Variations on Instant Insanity

Author(s)
Demaine, Erik D.; Demaine, Martin L.; Morgan, Thomas D.; Uehara, Ryuhei; Eisenstat, Sarah Charmian
Thumbnail
DownloadDemaine_Variations on.pdf (1.373Mb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2013
URI
http://hdl.handle.net/1721.1/86210
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-3-642-40272-2
978-3-642-40273-9
ISSN
0302-9743
1611-3349
Collections