dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Demaine, Martin L. | |
dc.contributor.author | Morgan, Thomas D. | |
dc.contributor.author | Uehara, Ryuhei | |
dc.contributor.author | Eisenstat, Sarah Charmian | |
dc.date.accessioned | 2014-04-17T19:29:58Z | |
dc.date.available | 2014-04-17T19:29:58Z | |
dc.date.issued | 2013 | |
dc.identifier.isbn | 978-3-642-40272-2 | |
dc.identifier.isbn | 978-3-642-40273-9 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/86210 | |
dc.description.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. | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-40273-9_4 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Variations on Instant Insanity | en_US |
dc.type | Article | en_US |
dc.identifier.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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Demaine, Erik D. | en_US |
dc.contributor.mitauthor | Demaine, Martin L. | en_US |
dc.contributor.mitauthor | Eisenstat, Sarah Charmian | en_US |
dc.relation.journal | Space-Efficient Data Structures, Streams, and Algorithms | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dspace.orderedauthors | Demaine, Erik D.; Demaine, Martin L.; Eisenstat, Sarah; Morgan, Thomas D.; Uehara, Ryuhei | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
dc.identifier.orcid | https://orcid.org/0000-0002-3182-1675 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |