WEKO3
インデックスリンク
アイテム
NP-completeness of generalized Kaboozle
https://doi.org/10.24517/00062801
https://doi.org/10.24517/0006280145c7ab47-b7af-48ee-ba5d-56ed1c2be6ed
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
TE-PR-ASANO-T-713.pdf (642.3 kB)
|
.png)
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2021-07-05 | |||||||
| タイトル | ||||||||
| タイトル | NP-completeness of generalized Kaboozle | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| ID登録 | ||||||||
| ID登録 | 10.24517/00062801 | |||||||
| ID登録タイプ | JaLC | |||||||
| 著者 |
Asano, Tetsuo
× Asano, Tetsuo× Demaine, Erik D.× Demaine, Martin L.× Uehara, Ryuhei |
|||||||
| 著者別表示 |
浅野, 哲夫
× 浅野, 哲夫
|
|||||||
| 提供者所属 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 金沢大学 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 20, 号 3, p. 713-718, 発行日 2012 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| DOI | ||||||||
| 関連タイプ | isIdenticalTo | |||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | 10.2197/ipsjjip.20.713 | |||||||
| 出版者 | ||||||||
| 出版者 | 情報処理学会 Information Processing Society of Japan | |||||||
| 抄録 | ||||||||
| 内容記述タイプ | Abstract | |||||||
| 内容記述 | 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-completenessof 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. © 2012 Information Processing Society of Japan. | |||||||
| 権利 | ||||||||
| 権利情報 | Copyright © 情報処理学会 Information Processing Society of Japan | |||||||
| 著者版フラグ | ||||||||
| 出版タイプ | VoR | |||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||
| 関連URI | ||||||||
| 識別子タイプ | URI | |||||||
| 関連識別子 | http://www.ipsj.or.jp/english/index.html | |||||||
| 関連名称 | http://www.ipsj.or.jp/english/index.html | |||||||
| 関連URI | ||||||||
| 識別子タイプ | URI | |||||||
| 関連識別子 | https://www.jstage.jst.go.jp/browse/ipsjjip/-char/en | |||||||
| 関連名称 | https://www.jstage.jst.go.jp/browse/ipsjjip/-char/en | |||||||
