Open questions on Tantrix graphs

DOI10.1017/MAG.2017.8MaRDI QIDQ5860070zbMATH OpenOpenAlexFDO

Authors H. Burgiel, Mahmoud El-Hashash

Publication date 18 November 2021

Published in The Mathematical Gazette (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/mag.2017.8

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of representation theory (05E10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Probabilistic games; gambling (91A60)

Recommendations

• An integer programming approach to solving Tantrix on fixed boards
• TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
• 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
• How many possible closed hexagons? — A mathematical problem from the Tri‐Ominos game

Cites work

• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Evolutionary computation approaches to the curriculum sequencing problem

Cited in

(4)

• Questions on orbital graphs
• An integer programming approach to solving Tantrix on fixed boards
• How many possible closed hexagons? — A mathematical problem from the Tri‐Ominos game
• Hexagon standoff

Describes a project that uses

Uses Software

• irace

This page was built for publication: Open questions on Tantrix graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5860070)