An integer programming approach to solving Tantrix on fixed boards (Q1736504)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An integer programming approach to solving Tantrix on fixed boards |
scientific article |
Statements
An integer programming approach to solving Tantrix on fixed boards (English)
0 references
26 March 2019
0 references
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.
0 references
combinatorial game theory
0 references
integer programming
0 references
mathematical programming solver
0 references
recreational mathematics
0 references
subloop elimination
0 references