Computing
Selected Slither Link Variants are NP-complete
2012 年 7 巻 3 号 p. 1015-1018
詳細
2012 年 7 巻 3 号 p. 1015-1018
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.
