From WPC unofficial wiki


Draw a single, non-intersecting loop that only consists of horizontal and vertical segments between the dots. A number inside a cell indicates how many of the edges of that cell are part of the loop.

(Rules and example from PGP IB)

History of the puzzle[edit]

First appeared on Nikoli volume 26 (1989). The rule was suggested by 矢田レーニン ("Yada Renin"). Originally named スリザーリンク.

Originally the puzzle was presented like Bosnian Road. It took the current form when Nikoli merged the elements of a different puzzle called ナンピツ ("Nanpitsu," suggested by 轟由紀 ("Todoroki Yuki"), first appeared also in 1989).


See list of Slitherlink variants.

Appearances in the past WPCs[edit]

Listed here are appearances of classic to almost-classic Slitherlink. For variants, see list of Slitherlink variants#Appearances in the past WPCs.