AI Chat AI Image Generator AI Video Text to Speech

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

04/23/2020

∙

by Hadyn Tang, et al.

∙

∙

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles invented by William Hu, and "Detour" is a genre of logic puzzle invented by online user Guowen Zhang. Each of these puzzles revolves around constructing a path or loop through the cells of a grid according to certain constraints given by clues in the grid. We prove that deciding whether a particular puzzle in each of these genres is solvable is NP-complete.

page 3

page 10

page 13

page 14

research

∙ 02/04/2022

A Framework for Loop and Path Puzzle Satisfiability NP-Hardness Results

Building on the results published in arxiv:2004.12849 we present a gener...

0 Hadyn Tang, et al. ∙

research

∙ 12/15/2021

ZHED is NP-complete

We prove that the 2017 puzzle game ZHED is NP-complete, even with just 1...

0 Sagnik Saha, et al. ∙

research

∙ 06/30/2017

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs

In 2007, Arkin et al. initiated a systematic study of the complexity of ...

0 Erik D. Demaine, et al. ∙

research

∙ 08/11/2020

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

Permutation Pattern Matching (PPM) is the problem of deciding for a give...

0 Vít Jelínek, et al. ∙

research

∙ 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 ...

0 Jeffrey Bosboom, et al. ∙

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-...

0 Zachary Abel, et al. ∙

research

∙ 08/16/2022

Order-Invariance of Two-Variable Logic is coNExpTime-complete

We establish coNExpTime-completeness of the problem of deciding order-in...

0 Bartosz Bednarczyk, et al. ∙