NP-completeness of generalized Kaboozle
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 2012-06-15
著者
-
Ryuhei Uehara
School Of Information Science Jaist
-
Tetsuo Asano
School Of Information Science Japan Advanced Institute Of Science And Technology (jaist)
-
Ryuhei Uehara
School Of Information Science Japan Advanced Institute Of Science And Technology (jaist)
関連論文
- Efficient Enumeration of All Pseudoline Arrangements
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
- NP-completeness of generalized Kaboozle
- Computational Complexity of Piano-Hinged Dissections
- Bumpy Pyramid Folding Problem
- Zipper Unfolding of Domes and Prismoids
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
- Intersection dimension of bipartite graphs
- FPT algorithms for Token Jumping on Graphs
- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid