The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions


Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this paper, we study the three-color and two-color TantrixTM rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed colors to three… (More)
DOI: 10.1007/978-3-540-88282-4_9


8 Figures and Tables

Blog articles referencing this paper

Slides referencing similar topics