Sciweavers

CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 4 months ago
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
Dorothea Baumeister, Jörg Rothe