|
|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9865
|
| タイトル: | Kaboozle Is NP-complete, Even in a Strip |
| 著者: | Asano, Tetsuo
Demaine, Erik
Demaine, Martin
Uehara, Ryuhei |
| キーワード: | Kaboozle
Transposer
silhouette
puzzle
origami |
| 発行日: | 2010-05-29 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 6099/2010 |
| 開始ページ: | 28 |
| 終了ページ: | 36 |
| DOI: | 10.1007/978-3-642-13122-6_5 |
| 抄録: | Kaboozle is a puzzle consisting of several square cards, each annotated with colored paths and dots drawn on both sides and holes drilled. The goal is to join two colored dots with paths of the same color (and fill all holes) by stacking the cards suitably. The freedoms here are to reflect, rotate, and order the cards arbitrarily, so it is not surprising that the problem is NP-complete (as we show). More surprising is that any one of these freedoms—reflection, rotation, and order—is alone enough to make the puzzle NP-complete. Furthermore, we show NP-completeness of a particularly constrained form of Kaboozle related to 1D paper folding. Specifically, we suppose that the cards are glued together into a strip, where each glued edge has a specified folding direction (mountain or valley). This variation removes the ability to rotate and reflect cards, and restricts the order to be a valid folded state of a given 1D mountain-valley pattern. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, Erik Demaine, Martin Demaine, and Ryuhei Uehara, Lecture Notes in Computer Science, 6099/2010, 2010, 28-36. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-13122-6_5 |
| URI: | http://hdl.handle.net/10119/9865 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| kaboozle.pdf | | 148Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
