Abstract
In one of the first papers about the complexity of puzzles, Robertson and Munro [14] proved that a generalized form of the thenpopular Instant Insanity puzzle is NP-complete. Here we study several variations of this puzzle, exploring how the complexity depends on the piece shapes and the allowable orientations of those shapes. © Springer-Verlag 2013.
Cite
CITATION STYLE
Demaine, E. D., Demaine, M. L., Eisenstat, S., Morgan, T. D., & Uehara, R. (2013). Variations on instant insanity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8066 LNCS, pp. 33–47). Springer Verlag. https://doi.org/10.1007/978-3-642-40273-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
