Selected Slither Link Variants are NP-complete
Jonas K ouml lker · Journal of Information Processing · 2012
In a Slither Link puzzle, the player must draw a cycle in a planar graph, such that the number of edges incident to a set of clue faces equals the set of given clue values. We show that for a number of commonly played graph classes, the Slither Link puzzle is NP-complete.