Slitherlink¶

Select edges of a clue-labeled planar lattice so local face counts and vertex degrees jointly form exactly one nonbranching closed loop.

Version: v1 · 2026-08-30 · History
Domain-specific #: 2791
Origin domain: recreational mathematics
Subdomain: loop forming logic puzzle
Aliases: Fences, Loop the Loop, Takegaki

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.^[1]

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. The global single-loop condition is therefore constitutive rather than a final aesthetic preference.^[2]

Slitherlink is not every draw-one-loop puzzle, one published board, or printed clue notation alone. Its autonomous residual is the generative instance schema plus local face counts, degree-zero-or-two vertices, and one global cycle. Numberlink connects terminal pairs, Masyu constrains turns at marked vertices, and Hamiltonian-cycle problems normally require visiting specified vertices. A board can have zero, one, or several solutions; publication typically seeks uniqueness, but uniqueness is an instance-quality condition rather than part of solution legality.^[3]

Structural Signature¶

Planar cell complex. Faces, vertices, and boundary edges define the finite playing graph.
Face clues. Selected integers constrain the number of chosen incident edges.
Edge variables. Each boundary segment is selected or excluded.
Vertex degree rule. Chosen edges meet every vertex with degree zero or two.
Single-cycle rule. All chosen edges belong to one connected simple loop.
Propagation state. Forced and forbidden edges carry deductions across the board.
Completion test. All local and global constraints are checked simultaneously.
Instance design. Clue placement controls solvability, uniqueness, and difficulty.

What It Is Not¶

Not one specific puzzle board. The abstraction is the recurrent instance and solution schema.
Not Hamiltonian cycle. Slitherlink need not visit every lattice vertex.
Not Numberlink. There are no terminal pairs requiring separate connecting paths.
Not Masyu. Slitherlink clues count face edges rather than prescribing turns at marked cells.
Not local clue satisfaction alone. Several disconnected loops can meet every local count.
Not a drawing convention. The loop is a constraint-satisfying edge set, not decorative line art.

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. A reader should be able to reconstruct the input, the operative rule, the output, and at least one defeater from the account without consulting an implementation or guessing an unstated convention.

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.. The compression is useful because it localizes disagreement. One can ask whether the input was properly formed, whether a constitutive relation held, whether an alternative explanation defeats the inference, or whether the output was overinterpreted. The same compression can mislead when its discarded detail is exactly what the decision requires. A reference-grade use therefore reports both the invariant retained and the information intentionally lost.

Abstract Reasoning¶

Represent every candidate edge as selected, excluded, or undecided.
Apply each clue's exact incident-edge count.
Apply the zero-or-two degree rule at every vertex.
Propagate forced selections and exclusions until stable.
Reject premature closed components that leave required edges outside.
Branch only when deduction no longer fixes an edge, retaining contradiction checks.
At completion verify clue counts, vertex degrees, and one connected cycle.
Test the candidate interpretation against the nearest named confusable rather than accepting a shared surface feature.
State the conclusion at the same scope as the source conditions, and retain uncertainty or nonuniqueness where the construct does not remove it.

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.

Examples¶

Canonical¶

On a square grid, a clue \(3\) means exactly three of the cell's four sides are selected. If two selected sides meet at a corner, other incident edges there are excluded. Even when every clue is satisfied, two small cycles fail because the selected subgraph must have exactly one connected cycle.

Mapped back: input and conventions → constitutive role test → bounded output → explicit interpretation and defeater check.

Applied / In Practice¶

A solver encodes edge choices as Boolean variables. Equalities enforce clues, local clauses enforce degree zero or two, and a connectivity cut excludes subtours. The encoding shows why Slitherlink is more than numeric clues: a global condition distinguishes the intended loop from disconnected locally valid cycles.

Mapped back: field observation or problem → candidate recognition → confusable and limit checks → appropriately scoped conclusion.

Structural Tensions¶

T1: Local propagation versus global connectivity. Face and vertex rules allow disconnected cycles. Diagnostic: Count connected components after every tentative closure.
T2: Satisfaction versus uniqueness. A legal loop need not be the only legal loop. Diagnostic: Enumerate a second solution or prove none exists.
T3: Board surface versus family identity. A magazine instance is an artifact of the general schema. Diagnostic: Vary dimensions and clues while preserving the constitutive constraints.
T4: Deduction versus search. A solution can be found by branching even if intended human deductions are unclear. Diagnostic: Separate logical implication, heuristic choice, and exhaustive search.
T5: Lattice variant versus different puzzle. Alternative tilings can preserve or change the role structure. Diagnostic: Map faces, edge counts, degree, and single-cycle conditions literally.
T6: Autonomy versus generic constraint. Constraint supplies admissibility, while Slitherlink fixes a graph-and-clue system. Diagnostic: Remove the face-count or single-cycle rule and test whether the same puzzle remains.

Structural–Framed Character¶

Rules and graph constraints are structural; clue layout, visual styling, and preferred human-solving difficulty are framed design choices. The five framing criteria point in a consistent direction. Evaluative weight is limited to whether the defining conditions are met, not whether the outcome is desirable. Human practice matters to the extent that experts choose conventions, instruments, or reporting thresholds, but those choices do not make every verdict arbitrary. Institutional history explains the name and standard use; it does not replace the recognition rule. The operative vocabulary travels within the home field and closely adjacent subfields, while transfer farther away requires translation to the parent prime. Thus recognition remains disciplined even where interpretation is defeasible.

Structural Core vs. Domain Accent¶

What is skeletal. Slitherlink instantiates Constraint because a solution is an edge assignment admitted by fixed local counts, vertex degrees, and a global one-cycle condition. This is the part that can be expressed without the candidate's specialist nouns.

What is domain-bound. The domain accent consists of planar lattices, cell clues, binary edges, vertex degree, simple cycles, connectivity cuts, deduction, and puzzle generation. Remove those elements and the result is no longer Slitherlink; it is only the parent relation or a loose analogy.

Why this does not clear the prime bar. The name does not recur with unchanged diagnostics across three independent domains. What transfers is already represented by prime:constraint. The candidate remains autonomous because its in-domain recognition rule, failure modes, and consequences are stable, but its vocabulary and interventions do not float free of the home substrate.

Slitherlink instantiates Constraint because a solution is an edge assignment admitted by fixed local counts, vertex degrees, and a global one-cycle condition.

The prospective workspace queue contains one strict upward edge to prime:constraint. No live DAG mutation is authorized.

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 (84^th 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

Not to Be Confused With¶

Numberlink. Connects labeled terminal pairs rather than forming one clue-counted boundary loop.
Masyu. Uses circle clues about turning and straight passage.
Hamiltonian cycle. Requires vertex visitation that Slitherlink does not generally impose.
Nonogram. Fills cells from row and column run counts.
Loop puzzle. A broad family lacking Slitherlink's exact face-count rule.
Subtour elimination. A generic encoding constraint rather than the whole puzzle identity.

References¶

[1] Nikoli Co., Ltd. ‘Slitherlink.’ Official puzzle rules and examples. https://www.nikoli.co.jp/en/puzzles/slitherlink/ registry ↩

[2] Kölker, J. (2012). ‘Selected Slither Link Variants are NP-complete.’ Journal of Information Processing 20(3), 709–712. https://doi.org/10.2197/ipsjjip.20.709 registry ↩

[3] Takenaga, Y., et al. (2012). ‘Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.’ Algorithms 5(2), 176–213. https://doi.org/10.3390/a5020176 registry ↩