Logic & Spatial Reasoning
Draw a single unbroken loop through the dot grid — no branches, no crossings, no dead ends. Nikoli's boundary-drawing puzzle is one of the most spatially demanding logic challenges ever devised.
How It Works
Slitherlink was invented by Nikoli Co., Ltd. in 1989 and has since become one of the most beloved puzzle forms in Japan, alongside Sudoku and Nonogram. The puzzle presents a rectangular grid of dots — typically 10×10 or larger — with numbers placed in some of the cells formed between the dots.
Each number tells you exactly how many of the four edges surrounding that cell are part of the loop. A 0 means none; a 3 means three. Blank cells give no direct information. Your task: draw exactly one continuous, non-self-intersecting closed loop using edges between adjacent dots that satisfies every numbered clue.
The topological constraint — one loop, closed, no branches — is what makes Slitherlink uniquely challenging. Unlike Sudoku where each cell is independent, every edge in Slitherlink affects every other edge it touches. A line segment added in one corner ripples constraints across the entire grid.
No edges filled — all four sides blank
Exactly one of four sides is part of the loop
Exactly two sides filled — many arrangements possible
Three sides filled — one side blank; very powerful clue
Essential Patterns
Slitherlink mastery is largely about pattern recognition. Once you can instantly recognize these 8 configurations and know their forced consequences, even difficult puzzles become approachable through systematic application.
A 3-cell in any corner of the grid has only 3 possible edges, and the clue requires exactly 3. Therefore all three available sides are filled. Two lines extend from the corner dot, one extends from the far corner. This is the most powerful beginner pattern — a corner 3 immediately places 3 certain line segments.
A 0 in a corner eliminates both edges along the grid border — mark them blank. A 1 in a corner means exactly one of the two border edges is filled; this doesn't resolve immediately, but once one adjacent cell is resolved, the other edge is determined.
Two 3-cells sharing an edge have a combined 6 edges needed from 7 total (the shared edge plus 6 unique). Since 6 of 7 must be filled, only 1 is blank. The shared internal edge is always filled, and the outer edges on the far sides of each 3 are both filled. This is one of Slitherlink's most recognizable forcing patterns.
Two 3-cells positioned diagonally (sharing a corner dot but not an edge) create a powerful constraint: the loop must pass through the shared dot from both cells' directions, determining two specific edges at the corner. The diagonal 3-3 pattern generates a distinctive spiral path.
A 0-cell has all four edges blank. If any neighboring cell has a number clue, you immediately know that the shared edge between them is blank — reducing that neighbor's available edges. Chains of 0-cells create blank corridors that sharply constrain the loop's path.
Every dot in the grid must have either 0 or 2 edges of the loop meeting it (a loop has no endpoints). If a dot already has 2 filled edges, mark all remaining edges at that dot as blank. If a dot has 2 blank edges out of 3, the remaining edge is forced — it must either be filled or blank based on whether 1 or 0 edges currently meet.
As you build the loop, a partial path has two open endpoints. If you draw an edge that would connect those endpoints prematurely (closing a small loop before all cells are satisfied), that edge is forbidden unless the entire puzzle would be complete. This rule eliminates many candidate edges in later-stage solving.
A closed loop divides the plane into inside and outside. The Jordan curve theorem guarantees this boundary. Advanced solvers track which regions are inside vs. outside and use this to determine edge states: if a cell is inside and a neighbor is outside, the shared edge must be filled. Counting crossings along any path from outside to any cell determines that cell's inside/outside status.
Learning Benefits
Slitherlink is one of the few puzzle forms that explicitly trains topological reasoning — the branch of mathematics concerned with properties that remain constant through continuous deformation. When you track whether a region is inside or outside the loop, you're applying the Jordan Curve Theorem intuitively.
Research on spatial cognition consistently shows that spatial visualization ability is one of the strongest predictors of performance in STEM fields. A 2013 longitudinal study published in Psychological Science found that spatial reasoning ability at age 13 predicted creative and scientific achievement 11 years later, independently of verbal and mathematical ability. Puzzles like Slitherlink that require mentally simulating how a path moves through 2D space directly exercise this spatial visualization capacity.
Inside vs. outside, connectivity, loop closure — these are fundamental concepts in computer science, geography, and advanced mathematics. Slitherlink makes them tactile and intuitive.
Mentally tracing how a path will need to travel around constraints — without actually drawing — exercises the visuospatial sketchpad, a component of working memory critical for geometry and engineering.
Slitherlink is a constraint satisfaction problem (CSP) at its core — the same class of problem used in AI planning and scheduling algorithms. Solving it manually builds intuition for how constraints propagate through interconnected systems.
Getting Started
Unlike Sudoku where difficulty is largely about naked triples and X-wings, Slitherlink difficulty scales with grid size AND with how sparse the number clues are. A 5×5 grid with mostly 2s is beginner-friendly. A 15×15 grid with many blanks requires advanced parity reasoning.
When you open a new puzzle, always start by:
For intermediate practice, Puzzle Loop offers free Slitherlink grids at multiple difficulty levels. The official Nikoli site provides sample puzzles in the original Japanese tradition. Both are excellent sources for structured progression from easy to expert.
FAQ
Slitherlink is a logic puzzle invented by Nikoli in 1989. It presents a rectangular grid of dots; between every adjacent pair of dots is a potential line segment. Numbers in cells indicate how many of the four surrounding edges are part of the loop. Your goal is to draw exactly one continuous, non-self-intersecting closed loop that satisfies every clue.
A 0 means none of the cell's four sides are part of the loop — all four edges are blank. A 1 means exactly one side is filled. A 2 means exactly two sides are filled. A 3 means exactly three sides are filled. Blank cells (no number) give no information about that cell's edges.
Slitherlink is particularly effective for developing spatial reasoning — the ability to mentally visualize how a path moves through 2D space. It also trains topological thinking (inside vs. outside a closed curve), parity reasoning (even/odd path properties), and constraint propagation. These skills transfer to geometry, computer science, and engineering.
Parity refers to the even/odd properties of how the loop crosses any line drawn through the grid. Because the loop is a closed curve, any straight line crosses it an even number of times. This means the number of filled edges on any row or column of dots must have consistent parity with the loop structure. Advanced solvers use this to propagate constraints across regions where number clues are sparse.
Sudoku constrains digit placement in discrete cells. Slitherlink constrains a continuous geometric path. Slitherlink requires spatial reasoning and topological thinking in addition to logic elimination — you must track whether regions are inside or outside the loop and whether partial paths can connect without creating premature loops or dead ends. Most Slitherlink solvers find it requires a different mental mode than number-placement puzzles.
Related Puzzles