NP-completeness of generalized Kaboozle

DOI DOI DOI IR IR View 2 Remaining Hide 3 Citations 1 References
  • Asano Tetsuo
    School of Information Science, Japan Advanced Institute of Science and Technology (JAIST)
  • Demaine Erik D.
    Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology (MIT)
  • Demaine Martin L.
    Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology (MIT)
  • Uehara Ryuhei
    School of Information Science, Japan Advanced Institute of Science and Technology (JAIST)

Search this article

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-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.

Journal

Citations (3)*help

See more

References(1)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top