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

Rikudo is NPcomplete
Rikudo is a numberplacement puzzle, where the player is asked to comple...
read it

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
Permutation Pattern Matching (PPM) is the problem of deciding for a give...
read it

Path Puzzles: Discrete Tomography with a Path Constraint is Hard
We prove that path puzzles with complete row and column informationor ...
read it

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
We analyze the computational complexity of the many types of penciland...
read it

Shellings from relative shellings, with an application to NPcompleteness
Shellings of simplicial complexes have long been a useful tool in topolo...
read it

A complete equational axiomatisation of partial differentiation
We formalise the wellknown rules of partial differentiation in a versio...
read it
On the NPCompleteness of Satisfying Certain Path and Loop Puzzles
"EyeWitless", "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 NPcomplete.
READ FULL TEXT
Comments
There are no comments yet.