Variations on Instant Insanity

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...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D., Demaine, Martin L., Morgan, Thomas D., Uehara, Ryuhei, Eisenstat, Sarah Charmian
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Springer-Verlag 2014
Online Access:http://hdl.handle.net/1721.1/86210
https://orcid.org/0000-0003-3803-5703
https://orcid.org/0000-0002-3182-1675