An integer programming approach to solving Tantrix on fixed boards
Summary: Tantrix (Tantrix\(^{\circledR}\) is a registered trademark of Colour of Strategy Ltd. in New Zealand, and of TANTRIX JAPAN in Japan, respectively, under the license of M. McManaway, the inventor.) is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we first give a problem setting of solving Tantrix as making a loop on a given fixed board. We then formulate it as an integer program by describing the rules of Tantrix as its constraints, and solve it by a mathematical programming solver to have a solution. As a result, we establish a formulation that can solve Tantrix of moderate size, and even when the solutions are invalid only by elementary constraints, we achieved it by introducing additional constraints and re-solve it. By this approach we succeeded to solve Tantrix of size up to 60.
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
- Open questions on Tantrix graphs
- 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
This page was built for publication: An integer programming approach to solving Tantrix on fixed boards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736504)
