HIROIMONO is NP-complete

Authors

  • Daniel Andersson

DOI:

https://doi.org/10.7146/brics.v14i1.21924

Abstract

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.

Downloads

Published

2007-01-12

How to Cite

Andersson, D. (2007). HIROIMONO is NP-complete. BRICS Report Series, 14(1). https://doi.org/10.7146/brics.v14i1.21924

Issue

No. 1 (2007): RS-1 HIROIMONO is NP-complete

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.