|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/12205
|
| Title: | Variations on Instant Insanity |
| Authors: | Demaine, Erik D.
Demaine, Martin L.
Eisenstat, Sarah
Morgan, Thomas D.
Uehara, Ryuhei |
| Keywords: | instant insanity
NP-completeness
polynomial time algorithm |
| Issue Date: | 2013 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 8066 |
| Start page: | 33 |
| End page: | 47 |
| DOI: | 10.1007/978-3-642-40273-9_4 |
| Abstract: | In one of the first papers about the complexity of puzzles, Robertson and Munro [12] 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. |
| Rights: | This is the author-created version of Springer, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, and Ryuhei Uehara, Lecture Notes in Computer Science, 8066, 2013, 33-47. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-40273-9_4 |
| URI: | http://hdl.handle.net/10119/12205 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 19460.pdf | | 1267Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
