HIROIMONO Is NP-Complete
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.
Unable to display preview. Download preview PDF.
- 1.Costello, M.J.: The greatest puzzles of all time. Prentice-Hall, Englewood Cliffs (1988)Google Scholar
- 4.Culberson, J.: Sokoban is PSPACE-complete. In: Proceedings of the International Conference on Fun with Algorithms, Carleton Scientific, pp. 65–76 (1998)Google Scholar
- 5.Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 86, 1052–1060 (2003)Google Scholar
- 7.Andersson, D.: Reduce 3-SAT to HIROIMONO, http://purl.org/net/koda/s2h.php