Slitherlink¶
Select edges of a clue-labeled planar lattice so local face counts and vertex degrees jointly form exactly one nonbranching closed loop.
Core Idea¶
Slitherlink is a family of finite logic puzzles played on a planar cell complex, commonly a square lattice, in which the solver selects boundary edges to form one simple closed loop. A clue inside a face states exactly how many of that face's incident edges belong to the loop. Unclued faces impose no count, but every vertex must have selected degree zero or two and the selected edges must form one connected component.
Local deductions propagate from clue counts, exhausted edges, and vertex-degree restrictions. Marking an edge can force exclusions around a face or continuation through a vertex; excluded edges can force remaining incident edges. Local consistency is insufficient because several disjoint cycles can satisfy every clue and degree condition.
Scope of Application¶
The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of Slitherlink itself, not metaphors based only on resemblance.
- Human solving. Propagating forced and forbidden edge consequences.
- Puzzle construction. Choosing clues that yield a solvable and preferably unique instance.
- Constraint programming. Encoding binary edges, face sums, degree rules, and connectivity.
- Complexity analysis. Studying satisfiability and hardness across lattice variants.
- Solution enumeration. Distinguishing no solution, unique solution, and multiple solutions.
- Variant comparison. Changing tilings or clue sets while preserving the loop-forming core.
Clarity¶
A clear account of Slitherlink must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. Define the underlying planar graph and which faces may carry clues. State face-count, vertex-degree, and global connectivity constraints separately. Distinguish satisfying assignments from the stronger publication goal of uniqueness. Do not infer global one-loop validity from locally consistent clues. These declarations are not editorial extras: each changes what observations count, which transformations are licensed, and what conclusion can be drawn.
Manages Complexity¶
Slitherlink manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: planar cell complex supplies faces, vertices, and boundary edges define the finite playing graph.; face clues supplies selected integers constrain the number of chosen incident edges.; edge variables supplies each boundary segment is selected or excluded.; vertex degree rule supplies chosen edges meet every vertex with degree zero or two.; single-cycle rule supplies all chosen edges belong to one connected simple loop..
Abstract Reasoning¶
- Represent every candidate edge as selected, excluded, or undecided. 2. Apply each clue's exact incident-edge count. 3. Apply the zero-or-two degree rule at every vertex. 4. Propagate forced selections and exclusions until stable. 5. Reject premature closed components that leave required edges outside. 6. Branch only when deduction no longer fixes an edge, retaining contradiction checks. 7. At completion verify clue counts, vertex degrees, and one connected cycle.
Knowledge Transfer¶
The strict upward abstraction is Constraint. Slitherlink instantiates Constraint because a solution is an edge assignment admitted by fixed local counts, vertex degrees, and a global one-cycle condition. Within loop forming logic puzzle, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label Slitherlink after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.
Relationships to Other Abstractions¶
Current abstraction Slitherlink Domain-specific
Parents (1) — more general patterns this builds on
-
Slitherlink is a kind of Constraint Prime
Slitherlink instantiates Constraint because a solution is an edge assignment admitted by fixed local counts, vertex degrees, and a global one-cycle condition.
Hierarchy path (1) — routes to 1 parentless root
- Slitherlink → Constraint
Neighborhood in Abstraction Space¶
Slitherlink sits in a sparse region of the domain-specific corpus (84th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Graph Coloring Games & Drawings (7 abstractions)
Nearest neighbors
- Planarity — 0.82
- Subgraph Isomorphism Problem — 0.81
- Pathwidth — 0.80
- RAC drawing — 0.80
- Cubic Graph — 0.80
Computed from structural-signature embeddings · 2026-09-08