The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions

Dorothea Baumeister, Jörg Rothe. The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. In Carlos Martín-Vide, Friedrich Otto, Henning Fernau, editors, Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers. Volume 5196 of Lecture Notes in Computer Science, pages 76-87, Springer, 2008. [doi]

Abstract

Abstract is missing.