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...
Main Authors: | Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Morgan, Thomas D. (Author), Uehara, Ryuhei (Author), Eisenstat, Sarah Charmian (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2014-04-17T19:29:58Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Flattening fixed-angle chains is strongly NP-hard
by: Demaine, Erik D., et al.
Published: (2012) -
Solving the Rubik's Cube optimally is NP-complete
by: Demaine, Erik D, et al.
Published: (2019) -
Any Monotone Function Is Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2014) -
Any Monotone Function Is Realized by Interlocked Polygons
by: Erik D. Demaine, et al.
Published: (2012-03-01) -
Zipper unfolding of domes and prismoids
by: Demaine, Erik D., et al.
Published: (2015)