Publication | Open Access
HIROIMONO is NP-complete
11
Citations
9
References
2007
Year
Computational ScienceComputational Complexity TheoryEngineeringGraph TheorySquare GridHiroimono PuzzleComputational ComplexityP Versus Np ProblemComputer ScienceDiscrete MathematicsCombinatorial OptimizationAspect-oriented ProgrammingGrid Lines
In a Hiroimono puzzle, one must collect a set of stones from a square grid, moving along grid lines, picking up stones as one encounters them, and changing direction only when one picks up a stone. We show that deciding the solvability of such puzzles is NP-complete.
| Year | Citations | |
|---|---|---|
Page 1
Page 1