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

page 4

page 8

page 19

research
09/11/2023

Sumplete is Hard, Even with Two Different Numbers

Sumplete is a logic puzzle famous for being developed by ChatGPT. The pu...
research
02/02/2023

This Game Is Not Going To Analyze Itself

We analyze the puzzle video game This Game Is Not Going To Load Itself, ...
research
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-...
research
07/26/2022

Fractal Images as Number Sequences I An Introduction

In this article, we considered a fractal image as a fractal curve, that ...
research
05/29/2021

Dynamic Placement in Refugee Resettlement

Employment outcomes of resettled refugees depend strongly on where they ...
research
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 ...
research
05/20/2021

Heesch Numbers of Unmarked Polyforms

A shape's Heesch number is the number of layers of copies of the shape t...

Please sign up or login with your details

Forgot password? Click here to reset