Journal of Information Processing
Online ISSN : 1882-6652
Selected Slither Link Variants are NP-complete
Jonas Kölker
Author information
JOURNALS FREE ACCESS

Volume 20 (2012) Issue 3 Pages 709-712

Details
Download PDF (556K) Contact us
Abstract

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.

Information related to the author
© 2012 by the Information Processing Society of Japan
Previous article Next article

Recently visited articles
feedback
Top