The game of Tantrix™ provides a challenging, mathematical and graphic domain for evolutionary computation. The simple task of forming long loops of colored ... of game pieces scales linearly. This paper introduces Tantrix-GA, a genetic algorithm that solves several types and sizes of Tantrix puzzles but still falls well short of (at least a few) human Tantrix experts. By introducing this problem to evolutionary computation ... motivate an evolutionary attack on the holy-grail Tantrix puzzles, one of which has yet to be ...
Tópico(s): Artificial Intelligence in Games
2005 - Springer Science+Business Media | Genetic Programming and Evolvable Machines
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 ... we first give a problem setting of solving Tantrix as making a loop on a given fixed ... an integer program by describing the rules of Tantrix as its constraints, and solve it by a ... result, we establish a formulation that can solve Tantrix of moderate size, and even when the solutions ... it. By this approach we succeeded to solve Tantrix of size up to 60.
Tópico(s): graph theory and CDMA systems
2012 - Multidisciplinary Digital Publishing Institute | Algorithms
Dorothea Baumeister, Jörg Rothe,
Holzer and Holzer [M. Holzer, W. Holzer, Tantrix™ rotation puzzles are intractable, Discrete Applied Mathematics 144(3) (2004) 345–358] proved that the Tantrix™ rotation puzzle problem with four colors is NP- ... we study the three-color and two-color Tantrix™ rotation puzzle problems (3-TRP and 2-TRP) ... respectively, to two) reduces the set of available Tantrix™ tiles from 56 to 14 (respectively, to 8). ... by Holzer and Holzer [M. Holzer, W. Holzer, Tantrix™ rotation puzzles are intractable, Discrete Applied Mathematics 144( ...
Tópico(s): Digital Image Processing Techniques
2009 - Elsevier BV | Information and Computation
Dorothea Baumeister, Jörg Rothe,
Holzer and Holzer [10] proved that the Tantrix™ rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undecidable. We study the counting version ...
Tópico(s): Computational Geometry and Mesh Generation
2009 - IOS Press | Fundamenta Informaticae
Domenico Mucci, Alberto Saracco,
... the “tangential” component of the derivative of the tantrix of the curve. We show that the total ...
Tópico(s): Advanced Numerical Analysis Techniques
2020 - Springer Science+Business Media | Rendiconti del Circolo Matematico di Palermo Series 2
Akihiro Uejima, Fuhito Yanagitani, Shohei Tsukamoto,
Tantrix Match is a puzzle in which hexagonal tiles are arranged within a hexagonal lattice board in ... this puzzle, and we prove that the generalized Tantrix Match is NP-complete by reduction from the ...
Tópico(s): Cellular Automata and Applications
2013 - | Journal of Information Processing
Heidi Burgiel, Mahmoud El-Hashash,
Tantrix TM tiles are black hexagons imprinted with three coloured paths [1] joining pairs of edges. There ...
Tópico(s): Cellular Automata and Applications
2017 - Cambridge University Press | The Mathematical Gazette
Tópico(s): Artificial Intelligence in Games
2012 - Springer Science+Business Media | Lecture notes in computer science
... topics include Rubik's Cube, Towers of Hanoi, Tantrix, Picture Mazes, and Arithmetical Restorations (Mushikui-Zan).The ...
Tópico(s): Advanced Numerical Analysis Techniques
2013 - | Journal of Information Processing