Slitherlink: Difference between revisions

Content added Content deleted
VisualWikitext
mNo edit summary
(Added various background information)
 
(2 intermediate revisions by one other user not shown)
Line 1: Line 1:
{{Logic Puzzle Sidebar}}
{{Logic Puzzle Sidebar}}


'''Slitherlink''' (also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza and Dotty Dilemma) is a type of [[Path Drawing (Logic Puzzle Type)|path-drawing]] [[Logic Puzzle|logic puzzle]] designed and published by Nikoli. Slitherlink puzzles are traditionally solved on a rectangular lattice of dots, or on a grid with traceable lines between vertices. Some of the squares in the grid/matrix will have numbers inside them, dictating the number of line segments that border that space. The objective is to create an enclosed loop that satisfies the border requirements set out by the numbered spaces.
'''Slitherlink''' (also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza, Dotty Dilemma, and Sli-Lin) is a type of [[Path Drawing (Logic Puzzle Type)|path-drawing]] [[Logic Puzzle|logic puzzle]] designed and published by Nikoli. The premise involves drawing a loop on a lattice that satisfies the border requirements set out by the numbered spaces.
⚫
[[File:Slitherlink Example.png|thumb|An unsolved Slitherlink puzzle|201x201px]]
⚫
[[File:Slitherlink Example Solution.png|thumb|Solution to the above Slitherlink example.|200x200px]]
⚫
There are not many variations, as the primary method of changing the way the puzzle is solved is by changing the shape or size of the grid, as any planar graph can be used in place of a simple rectangular matrix/grid.


== Background ==
== Background ==

Slitherlink as a genre was first published in June 1989 in ''Puzzle Communication Nikoli'' issue 26. The ruleset for the genre was suggested by 矢田レーニン ("Yada Renin").<ref>[https://wpcunofficial.miraheze.org/wiki/Slitherlink Slitherlink - WPC unofficial wiki]</ref> Determining whether a general slitherlink puzzle is solvable was shown to be NP-complete by Takayuki Yato in 2000.<ref>Yato, Takayuki. "On the NP-completeness of the Slither Link puzzle." ''IPSJ SIGNotes ALgorithms'' 74 (2000): 25-32.</ref>

{{To do}}
{{To do}}


== Puzzle Application ==
== Puzzle Application ==

{{To do}}
⚫
[[File:Slitherlink Example.png|thumb|An unsolved Slitherlink puzzle|201x201px]]

Most slitherlinks are presented in a rectangular lattice grid as shown, with some of the squares having a number. These numbers, which range from 0 to 3, indicate how many of its borders are part of the loop.

⚫
The primary method of changing the way the puzzle is solved is by changing the shape or size of the grid, as any planar graph can be used in place of a simple rectangular grid. In fact, the only non-rectangular lattice formed by regular polygons are triangular lattices or hexagonal lattices.


== Strategy ==
== Strategy ==

{{To do}}
⚫
[[File:Slitherlink Example Solution.png|thumb|Solution to the above Slitherlink example.|200x200px]]

Many of the strategies not only involve drawing lines that would go on the loop but marking line segments that would not go on the loop. Below are some examples.

* Squares containing a 0 can immediately have all of its sides be marked as not on the loop.
* Squares containing a number N that have 4-N of its sides be marked as not on the loop have the rest of the sides on the loop.
* Squares on the corner containing a 3 must have the two sides touching the edge of the grid be part of the loop.
* Two adjacent squares each containing a 3 must have the segment between them be part of the loop.
* Because the loop can not self-intersect, each lattice point can have 0 or 2 segments (either a line or a turn) coming from that point. This can eliminate some segments or force the line to go a certain way.
* Segments that reach a "dead end" can also be marked as not on the grid.


==Notable Examples==
==Notable Examples==

{{To do}}
===Played Straight===

* {{ExamplePuzzle|MIT Mystery Hunt 2014/Magic Mushrooms|Magic Mushrooms (MIT Mystery Hunt 2014)|https://puzzles.mit.edu/2014/puzzle/magic_mushrooms/}} - Some of the numbers in this slitherlink are marked by a mushroom to indicate that they are off-by-one.
* {{ExamplePuzzle|Shardhunt/Join, Or Die|Join, Or Die (Shardhunt 2023)|https://shardhunt.com/puzzle/join-or-die.html}} - This slitherlink uses a triangular grid but otherwise works normally.

===Notable Twists===

* {{ExamplePuzzle|MIT Mystery Hunt 2016/Cubism|Cubism (MIT Mystery Hunt 2016)|https://puzzles.mit.edu/2016/puzzle/cubism/solution/}} - This is a 3D version of slitherlink, in which the goal is to create a 2D surface.
* {{ExamplePuzzle|MIT Mystery Hunt 2018/Good Fences Make Sad and Disgusted Neighbors|Good Fences Make Sad and Disgusted Neighbors (MIT Mystery Hunt 2018)|http://web.mit.edu/puzzle/www/2018/full/puzzle/good_fences_make_sad_and_disgusted_neighbors.html}} - This slitherlink uses a hexagonal grid, but only some of the numbers actually represent slitherlink rules.
* {{ExamplePuzzle|MIT Mystery Hunt 2021/Slitheɹlᴉuʞs|Slitheɹlᴉuʞs (MIT Mystery Hunt 2021)|https://puzzles.mit.edu/2021/puzzle/slithe%C9%B9lᴉu%CA%9Es/}} - These slitherlinks are not only combined with other logic rules but also involve a literal twist on the paper.


== See Also ==
== See Also ==


* [[:Category:Slitherlink|Puzzles that involve Slitherlinks]]
* [[:Category:Slitherlink|Puzzles that involve Slitherlinks]]
* [https://puzz.link/db/?type=slitherlink Slitherlink Puzzles on puzz.link]


[[Category:Elements]]
[[Category:Elements]]

Latest revision as of 13:24, 29 February 2024

Part of a series on
Logic Puzzles
Grid Constraint
Deduction

Slitherlink (also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza, Dotty Dilemma, and Sli-Lin) is a type of path-drawing logic puzzle designed and published by Nikoli. The premise involves drawing a loop on a lattice that satisfies the border requirements set out by the numbered spaces.

Background[edit | edit source]

Slitherlink as a genre was first published in June 1989 in Puzzle Communication Nikoli issue 26. The ruleset for the genre was suggested by 矢田レーニン ("Yada Renin").[1] Determining whether a general slitherlink puzzle is solvable was shown to be NP-complete by Takayuki Yato in 2000.[2]

To do TO DO

Puzzle Application[edit | edit source]

An unsolved Slitherlink puzzle

Most slitherlinks are presented in a rectangular lattice grid as shown, with some of the squares having a number. These numbers, which range from 0 to 3, indicate how many of its borders are part of the loop.

The primary method of changing the way the puzzle is solved is by changing the shape or size of the grid, as any planar graph can be used in place of a simple rectangular grid. In fact, the only non-rectangular lattice formed by regular polygons are triangular lattices or hexagonal lattices.

Strategy[edit | edit source]

Solution to the above Slitherlink example.

Many of the strategies not only involve drawing lines that would go on the loop but marking line segments that would not go on the loop. Below are some examples.

  • Squares containing a 0 can immediately have all of its sides be marked as not on the loop.
  • Squares containing a number N that have 4-N of its sides be marked as not on the loop have the rest of the sides on the loop.
  • Squares on the corner containing a 3 must have the two sides touching the edge of the grid be part of the loop.
  • Two adjacent squares each containing a 3 must have the segment between them be part of the loop.
  • Because the loop can not self-intersect, each lattice point can have 0 or 2 segments (either a line or a turn) coming from that point. This can eliminate some segments or force the line to go a certain way.
  • Segments that reach a "dead end" can also be marked as not on the grid.

Notable Examples[edit | edit source]

Played Straight[edit | edit source]

  • Magic Mushrooms (MIT Mystery Hunt 2014) (web) - Some of the numbers in this slitherlink are marked by a mushroom to indicate that they are off-by-one.
  • Join, Or Die (Shardhunt 2023) (web) - This slitherlink uses a triangular grid but otherwise works normally.

Notable Twists[edit | edit source]

  • Cubism (MIT Mystery Hunt 2016) (web) - This is a 3D version of slitherlink, in which the goal is to create a 2D surface.
  • Good Fences Make Sad and Disgusted Neighbors (MIT Mystery Hunt 2018) (web) - This slitherlink uses a hexagonal grid, but only some of the numbers actually represent slitherlink rules.
  • Slitheɹlᴉuʞs (MIT Mystery Hunt 2021) (web) - These slitherlinks are not only combined with other logic rules but also involve a literal twist on the paper.

See Also[edit | edit source]

  1. ↑ Slitherlink - WPC unofficial wiki
  2. ↑ Yato, Takayuki. "On the NP-completeness of the Slither Link puzzle." IPSJ SIGNotes ALgorithms 74 (2000): 25-32.
Retrieved from "https://www.puzzles.wiki/wiki/Slitherlink?oldid=10468"