Slitherlink
From 谜题百科 - PuzzleWiki
(以“'''Slitherlink'''(also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza and Dotty Dilemma,スリザーリンク) is a logic puzzle developed by pub...”为内容创建页面) |
|||
| Line 1: | Line 1: | ||
'''Slitherlink'''(also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza and Dotty Dilemma,スリザーリンク) is a logic puzzle developed by publisher Nikoli. | '''Slitherlink'''(also known as Fences, Takegaki, Loop the Loop, Loopy, Ouroboros, Suriza and Dotty Dilemma,スリザーリンク) is a logic puzzle developed by publisher Nikoli. | ||
| − | ==Rules== | + | [[File:Slitherlink_Example.png|200px|thumb|right|'''Slitherlink'''例题]] |
| + | |||
| + | ==Rules/规则== | ||
Slitherlink is played on a rectangular lattice of dots. Some of the squares formed by the dots have numbers inside them. The objective is to connect horizontally and vertically adjacent dots so that the lines form a simple loop with no loose ends. In addition, the number inside a square represents how many of its four sides are segments in the loop. | Slitherlink is played on a rectangular lattice of dots. Some of the squares formed by the dots have numbers inside them. The objective is to connect horizontally and vertically adjacent dots so that the lines form a simple loop with no loose ends. In addition, the number inside a square represents how many of its four sides are segments in the loop. | ||
Other types of planar graphs can be used in lieu of the standard grid, with varying numbers of edges per vertex or vertices per polygon. These patterns include snowflake, Penrose, Laves and Altair tilings. These add complexity by varying the number of possible paths from an intersection, and/or the number of sides to each polygon; but similar rules apply to their solution. | Other types of planar graphs can be used in lieu of the standard grid, with varying numbers of edges per vertex or vertices per polygon. These patterns include snowflake, Penrose, Laves and Altair tilings. These add complexity by varying the number of possible paths from an intersection, and/or the number of sides to each polygon; but similar rules apply to their solution. | ||
| + | |||
| + | 1. 把点与点以直线相连，使之成为一个完整的回路，只能有一个回路，不能有两个。 | ||
| + | 2. 在四点之间的数字，代表在这数字四周的线的数目。在没有数字的地方，划线的数目没有任何限制，而０的四周则不能有任何划线。 | ||
| + | 3. 路线不能交叉，也不能有分岔。 | ||
| − | ==Solving techniques== | + | [[File:Slitherlink_example_sol.png|200px|thumb|right|'''Slitherlink'''例题解答]] |
| + | |||
| + | ==Solving techniques/解题技巧== | ||
To be edited | To be edited | ||
| + | |||
| + | 多运用×将不可能连线的地方×掉，特别是直角位置的地方 | ||
==History== | ==History== | ||
| Line 23: | Line 33: | ||
*[http://www.nikoli.co.jp/en/puzzles/slitherlink/ Slitherlink puzzles] on the Nikoli web site | *[http://www.nikoli.co.jp/en/puzzles/slitherlink/ Slitherlink puzzles] on the Nikoli web site | ||
*[http://www.kwontomloop.com/ KwontomLoop] - A free site with daily slitherlink puzzles varying in difficulty. Also includes a ranking system with other players.* | *[http://www.kwontomloop.com/ KwontomLoop] - A free site with daily slitherlink puzzles varying in difficulty. Also includes a ranking system with other players.* | ||
| + | |||
| + | [[Category:Puzzlelist]] | ||
| + | [[Category:Make the Loop]] | ||
| + | [[Category:Nikoli]] | ||
| + | [[Category:Classic Puzzle]] | ||
