Hiroimono is NP-complete

Authors:
Daniel Andersson
Affiliations:
Department of Computer Science, University of Aarhus, Denmark
Venue:
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Year:
2007

Citing 2
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Tetris is hard, even to approximate

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Computational complexity of string puzzles

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	0.00

Visualization

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.