• Daniel Andersson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)


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.

Unable to display preview. Download preview PDF.


  1. 1.
    Costello, M.J.: The greatest puzzles of all time. Prentice-Hall, Englewood Cliffs (1988)Google Scholar
  2. 2.
    Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 351–363. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer 22, 9–15 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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. 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
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, New York (1979)zbMATHGoogle Scholar
  7. 7.
    Andersson, D.: Reduce 3-SAT to HIROIMONO,

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Daniel Andersson
    • 1
  1. 1.Department of Computer Science, University of AarhusDenmark

Personalised recommendations