An integer programming approach to solving Tantrix on fixed boards

DOI10.3390/A5010158MaRDI QIDQ1736504zbMATH OpenOpenAlexFDO

Authors Fumika Kino, Yushi Uno

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a5010158

zbMATH Keywords

combinatorial game theoryinteger programmingmathematical programming solverrecreational mathematicssubloop elimination

Mathematics Subject Classification ID

Recreational mathematics (00A08) Integer programming (90C10) Combinatorial games (91A46)

Recommendations

• TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
• Open questions on Tantrix graphs
• 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
• Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

Cited in

(2)

• TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable
• Open questions on Tantrix graphs

This page was built for publication: An integer programming approach to solving Tantrix on fixed boards

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