Rikudo is NP-complete

01/22/2021
by   Viet-Ha Nguyen, et al.
0

Rikudo is a number-placement puzzle, where the player is asked to complete a Hamiltonian path on a hexagonal grid, given some clues (numbers already placed and edges of the path). We prove that the game is complete for NP, even if the puzzle has no hole. When all odd numbers are placed it is in P, whereas it is still NP-hard when all numbers of the form 3k+1 are placed.

READ FULL TEXT

Authors

page 4

page 8

page 19

11/22/2017

Shellability is NP-complete

We prove that for every d≥ 2, deciding if a pure, d-dimensional, simplic...
04/26/2018

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible

We analyze the computational complexity of the many types of pencil-and-...
05/20/2021

Heesch Numbers of Unmarked Polyforms

A shape's Heesch number is the number of layers of copies of the shape t...
05/29/2021

Dynamic Placement in Refugee Resettlement

Employment outcomes of resettled refugees depend strongly on where they ...
06/14/2022

Sequential Optimization Numbers and Conjecture about Edge-Symmetry and Weight-Symmetry Shortest Weight-Constrained Path

This paper defines multidimensional sequential optimization numbers and ...
04/23/2020

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...
03/03/2018

Path Puzzles: Discrete Tomography with a Path Constraint is Hard

We prove that path puzzles with complete row and column information--or ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.