Variations on Instant Insanity
Name
Demaine_Variations on.pdf
Size
1.37 MB
Format
Adobe PDF
Checksum (MD5)
42adaf80f1b95e6e73aab2d9bbde86fe
Author(s)
Demaine, Erik D.
Demaine, Martin L.
Morgan, Thomas D.
Uehara, Ryuhei
Eisenstat, Sarah Charmian
Date Issued
2013
Journal
Space-Efficient Data Structures, Streams, and Algorithms
Publisher
Springer-Verlag
Citation
Demaine, Erik D., Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, and Ryuhei Uehara. “Variations on Instant Insanity.” Lecture Notes in Computer Science (2013): 33–47.
Version
Author's final manuscript
Abstract
In one of the first papers about the complexity of puzzles, Robertson and Munro [14] proved that a generalized form of the then-popular 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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-40273-9_4
