J-STAGE Home  >  Publications - Top  > Bibliographic Information

Journal of Information Processing
Vol. 20 (2012) No. 3 pp. 709-712



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.

Copyright © 2012 by the Information Processing Society of Japan

Article Tools

Share this Article