Slitherlink Puzzle Generator screenshot

Slitherlink Puzzle Generator

Generate a slitherlink loop puzzle with numbered cells and a proved single loop.

Privacy First
0 Runs
Updated 2026-11-22
Runs in your tab
No upload
Proven answer
Print and text download

What this page makes

Builds a 5×5 to 8×8 slitherlink: a single closed loop on the lattice, a number in every cell counting the loop edges around it, and a solver that proves the loop is unique.

How to use it

Choose the size and difficulty, then press Generate. Each number says how many of that cell's four sides are part of the loop. Draw one closed loop that uses no branching and no second circuit. Open Answer key to check the loop after printing.

Worked example: 5×5, medium difficulty, seed slitherlink-demo becomes a numbered grid with one proved loop and the loop drawn under the board.

What it proves

A simple loop is grown as the boundary of a random polyomino, rejecting any cell addition that would pinch the boundary at a vertex. Each cell's clue is the count of its four edges that belong to the loop. The solver propagates per-cell edge counts and per-vertex degrees (0 or 2), branches on an edge, and accepts only a final set of edges that forms one closed circuit.

What it refuses

A seed that cannot be proved unique inside the node budget and 120 loops is refused; the page never prints a clue set with two loops.

Where it runs

The puzzle is generated and solved in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device. The same seed and options rebuild the same puzzle exactly.

The rest of the family

The other puzzle generators are listed under Tabletop & Game Tools: killer sudoku, kakuro, KenKen, futoshiki, nonograms, slitherlink, Hashi, word search, crossword, magic squares and buzzword bingo.

Builds a 5×5 to 8×8 slitherlink: a single closed loop on the lattice, a number in every cell counting the loop edges around it, and a solver that proves the loop is unique.

A simple loop is grown as the boundary of a random polyomino, rejecting any cell addition that would pinch the boundary at a vertex. Each cell's clue is the count of its four edges that belong to the loop. The solver propagates per-cell edge counts and per-vertex degrees (0 or 2), branches on an edge, and accepts only a final set of edges that forms one closed circuit. Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.

Worked example: 5×5, medium difficulty, seed slitherlink-demo becomes a numbered grid with one proved loop and the loop drawn under the board.

Before the puzzle is shown, the same solver is run over it: the answer, the solution count and the node cap are printed under the board, so the proof is checkable rather than promised.

How to use the slitherlink puzzle generator

Choose the size and difficulty, then press Generate. Each number says how many of that cell's four sides are part of the loop. Draw one closed loop that uses no branching and no second circuit. Open Answer key to check the loop after printing.

Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.

  • Grid size — one of 5, 6, 7, 8
  • Difficulty — one of easy, medium, hard
  • Seed (blank draws one) — typed text

What the page proves

Builds a 5×5 to 8×8 slitherlink: a single closed loop on the lattice, a number in every cell counting the loop edges around it, and a solver that proves the loop is unique.

A simple loop is grown as the boundary of a random polyomino, rejecting any cell addition that would pinch the boundary at a vertex. Each cell's clue is the count of its four edges that belong to the loop. The solver propagates per-cell edge counts and per-vertex degrees (0 or 2), branches on an edge, and accepts only a final set of edges that forms one closed circuit.

  • Domain: 5×5 to 8×8 cell grids; every cell carries its edge count, including 0, and the loop is drawn only in the answer key.
  • The seed is printed with the puzzle and rebuilds it exactly: the same seed and options always produce the same grid.
  • A generation that cannot prove its answer inside the stated node cap is refused with the seed kept, rather than printed with an unchecked answer.

What it refuses, and what it leaves out

A seed that cannot be proved unique inside the node budget and 120 loops is refused; the page never prints a clue set with two loops.

  • Not the right page for: a slitherlink with blank clue cells
  • Not the right page for: a puzzle with diagonal edges

What to Expect

Best for

  • a loop-drawing logic puzzle
  • a printable grid with no letters
  • a puzzle that needs one continuous line

Not ideal for

  • a slitherlink with blank clue cells
  • a puzzle with diagonal edges

What this tool keeps

  • every cell's edge count
  • the one-loop proof
  • the drawn loop in the answer key

What may need cleanup

  • printing before opening the answer key
  • using a larger grid when the loop feels cramped

Common errors

  • a clue is always between 0 and 4
  • two loops means the clue set is refused

Example use cases

  • a logic-puzzle page
  • a classroom deduction exercise
  • a commute puzzle

Sample input

5×5, medium difficulty, seed slitherlink-demo

Sample output

a numbered grid with one proved loop and the loop drawn under the board

Who this is for

  • Logic-puzzle players
  • Teachers
  • Anyone who likes loop puzzles

Frequently asked questions

Is my data sent anywhere?

Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.

What can I download or print?

Print shows the puzzle and, if you open it, the answer key. Download writes a plain text file with the seed, the facts the page proved and the answer key; both are produced in this tab and neither is uploaded.

Why does the page print a seed?

So a puzzle can be rebuilt exactly. The same seed and the same options give the same puzzle on any machine, because the only randomness is a hash of the seed. Leave the field blank for a fresh one; the seed that was used is written back into the field.

What counts as a side?

A cell has four sides: top, bottom, left and right. The number in the cell is how many of those four are drawn as part of the loop. A 0 means none of them, and a 3 means exactly one side is absent.

Can the loop touch itself at a corner?

No. The generator grows the loop as a polyomino boundary and rejects any pinch, so the drawn loop never crosses or touches itself at a vertex. The solver also requires every used vertex to have degree two.

Why is the answer not drawn on the puzzle?

Drawing it would give the puzzle away. The board shows only the clues; the loop appears when you open the answer key or press Print after opening it.

Developer program

Build custom tools for your store

Join the SDK program to create useful ecommerce utilities for your store.