TANTRIX^TM rotation puzzles are intractable
From MaRDI portal
Publication:1765243
Recommendations
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
- Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
- An integer programming approach to solving Tantrix on fixed boards
Cites work
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 3555903 (Why is no real title available?)
- Domino Games and Complexity
- GO Is Polynomial-Space Hard
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Minesweeper is NP-complete.
- On the complexity of chess
- Planar Crossovers
- The complexity of theorem-proving procedures
Cited in
(9)- An integer programming approach to solving Tantrix on fixed boards
- How to solve the torus puzzle
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
- Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem
- Open questions on Tantrix graphs
- Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions
- Variations on instant insanity
- Tetris and decidability
This page was built for publication: TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765243)
