Title
An Integer Programming Approach To Solving Tantrix On Fixed Boards
Abstract
Tantrix (Tantrix (R) 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.
Year
DOI
Venue
2012
10.3390/a5010158
ALGORITHMS
Keywords
Field
DocType
combinatorial game theory, integer programming, mathematical programming solver, recreational mathematics, subloop elimination
Integer,Combinatorial game theory,Mathematical optimization,Computer science,Hexagonal crystal system,Recreational mathematics,Integer programming,Artificial intelligence,Solver,Machine learning
Journal
Volume
Issue
ISSN
5
1
1999-4893
Citations 
PageRank 
References 
1
0.38
0
Authors
2
Name
Order
Citations
PageRank
Fumika Kino110.72
yushi uno222228.80