Back

Slitherlink (86)

Other names: Fences

Instruction:
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.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2014 - Round 1 (87)
WPF Puzzle GP 2014 - Round 2 (88)
WPF Puzzle GP 2014 - Round 3 (89)
WPF Puzzle GP 2014 - Round 4 (90)
WPF Puzzle GP 2015 - Playoffs (95)
WPF Puzzle GP 2015 - Round 2 (81)
WPF Puzzle GP 2016 - Playoffs (94)
WPF Puzzle GP 2016 - Round 1 Competitive (36)
WPF Puzzle GP 2016 - Round 5 Competitive (41)
WPF Puzzle GP 2017 - Playoffs (93)
WPF Puzzle GP 2017 - Round 1A (21)
WPF Puzzle GP 2017 - Round 3B (25)
WPF Puzzle GP 2017 - Round 4A (19)
WPF Puzzle GP 2017 - Round 4B (20)
WPF Puzzle GP 2017 - Round 6X (27)
WPF Puzzle GP 2018 - Round 1 (51)
WPF Puzzle GP 2018 - Round 4 (54)
WPF Puzzle GP 2018 - Round 5 (55)
WPF Puzzle GP 2019 - Round 8 (139)
WPF Puzzle GP 2021 - Round 3 (167)
WPF Puzzle GP 2021 - Round 5 (169)
WPF Puzzle GP 2021 - Round 8 (172)
WPF Puzzle GP 2022 - Round 1 (181)
WPF Puzzle GP 2022 - Round 3 (183)
WPF Puzzle GP 2022 - Round 4 (184)
WPF Puzzle GP 2022 - Round 7 (187)
Child puzzles:
Fences Switch
Liar Diagonal Slitherlink
Pentomino Fences
Polygraph
Slitherlink (Big Cells)
Slitherlink (Corners)
Slitherlink (Encoded)
Slitherlink (Full Evens)
Slitherlink (Hexagonal)
Slitherlink (No Swiss)
Slitherlink (Out-Liars)
Slitherlink (Pentominoes)
Slitherlink (Unequal Lengths)
Slitherlink (Wolves and Sheep)
Yin-Yang Slitherlink
Related puzzles:
Hideout Fences
Myopia