Satisfiability parsimoniously reduces to the tantrix™ rotation puzzle problem

Abstract

Holzer and Holzer [HH04] 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 and the unique version of this problem. We prove that the satisfiability problem parsimoniously reduces to the Tantrix rotation puzzle problem. In particular, this reduction preserves the uniqueness of the solution, which implies that the unique Tantrix™ rotation puzzle problem is as hard as the unique satisfiability problem, and so is DP-complete under polynomial-time randomized reductions, where DP is the second level of the boolean hierarchy over NP. © Springer-Verlag Berlin Heidelberg 2007.