Solving tantrix via integer programming

作者: Fumika Kino , Yushi Uno

DOI: 10.1007/978-3-642-30347-0_25

关键词: AlgorithmInteger (computer science)Integer programmingLOOP (programming language)Mathematical optimizationSolverMathematicsHexagonal latticeHexagonal crystal system

摘要: Tantrix is a puzzle to make loop by connecting lines drawn on hexagonal tiles, and the objective of this research solve it computer. For purpose, we give problem setting solving as arranging tiles in an appropriate shape making at same time within given lattice board. We then formulate integer program expressing rules its constraints, mathematical programming solver have solution. As result, establish formulation that solves moderate sizes, even when solutions are invalid only elementary achieved introducing additional constraints artificial function avoid flaws solutions. By approach successful size up 50.

参考文章(21)
David L. Applegate, William J. Cook, Vasek Chvatal, Robert E. Bixby, The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) Princeton University Press. ,(2007)
Beth M. Schlesinger, Martin Gardner's Mathematical Games: The Entire Collection of His Scientific American Columns Mathematics Teacher: Learning and Teaching PK–12. ,vol. 99, pp. 528- ,(2006)
Jan Karel Lenstra, David Shmoys, The Traveling Salesman Problem: A Computational Study ,(2007)
Richard J. Nowakowski, Michael H. Albert, David Wolfe, Lessons in Play: An Introduction to Combinatorial Game Theory ,(2007)
Erik D. Demaine, Gerald J. Sussman, Robert Aubrey Hearn, Games, Puzzles, and Computation ,(2009)
Erik D Demaine, Martin L Demaine, Nicholas JA Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno, UNO is hard, even for a single player fun with algorithms. ,vol. 6099, pp. 133- 144 ,(2010) , 10.1007/978-3-642-13122-6_15
Fumika Kino, Yushi Uno, An Integer Programming Approach to Solving Tantrix on Fixed Boards Algorithms. ,vol. 5, pp. 158- 175 ,(2012) , 10.3390/A5010158
David Lichtenstein, Michael Sipser, GO Is Polynomial-Space Hard Journal of the ACM. ,vol. 27, pp. 393- 401 ,(1980) , 10.1145/322186.322201
Erik D. Demaine, Playing Games with Algorithms: Algorithmic Combinatorial Game Theory mathematical foundations of computer science. pp. 18- 32 ,(2001) , 10.1007/3-540-44683-4_3