Slitherlink: Difference between revisions
Leveloneknob (talk | contribs) No edit summary |
Leveloneknob (talk | contribs) No edit summary |
||
| Line 4: | Line 4: | ||
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. |
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. |
||
==Notable Examples== |
|||
==Puzzles That Utilize This Element== |
|||
{| class="wikitable" |
|||
|- |
|||
! Puzzle Title !! Hunt Name !! Round Name |
|||
|- |
|||
| [[The Ferris of Them All]] || [[MIT Mystery Hunt (2020)|MITMH 2020]] || [[The Grand Castle]] |
|||
|- |
|||
| [[Penny Park Guide]] || [[MIT Mystery Hunt (2020)|MITMH 2020]] || [[The Grand Castle]] |
|||
|- |
|||
| [[Ox (Bull)]] || [[MIT Mystery Hunt (2020)|MITMH 2020]] || [[Safari Adventure]] |
|||
|} |
|||
Revision as of 05:23, 12 July 2021
Slitherlink (also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza and Dotty Dilemma) is a type of path-drawing 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.
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.
