TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable

DOI10.1016/j.dam.2003.11.011zbMath1156.68391OpenAlexW2161957859MaRDI QIDQ1765243

Waltraud Holzer, Markus Holzer

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.011

Mathematics Subject Classification ID

Related Items (2)

The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions ⋮ The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of chess
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Domino Games and Complexity
• GO Is Polynomial-Space Hard
• Planar Crossovers
• The complexity of theorem-proving procedures
• Minesweeper is NP-complete.

This page was built for publication: TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable