2 papers
cs.CC2007
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Dorothea Baumeister, Joerg Rothe
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the…
cs.CC2007
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem
Dorothea Baumeister, Joerg Rothe
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem is NP-complete. They also showed that for infinite rotati…