Skip to main content
Conference Proceedings

Hiroimono is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4475 LNCS 30-39
DOI: 10.1007/978-3-540-72914-3_5
8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Andersson, D. (2007). Hiroimono is NP-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4475 LNCS, pp. 30–39). Springer Verlag. https://doi.org/10.1007/978-3-540-72914-3_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free