Skip to content

Loopy: satisfy a clue without closing the loop too early

Loopy requires one unbroken loop whose edges satisfy every numbered face. Filling the four sides around a square clue of four would satisfy that face locally, but a completed loop must also be the single global solution.

← All guides
Loopy: satisfy a clue without closing the loop too early
Loopy: satisfy a clue without closing the loop too early. Original editorial schematic; not a captured game board.

One loop, not several

Loopy requires one unbroken loop whose edges satisfy every numbered face. Filling the four sides around a square clue of four would satisfy that face locally, but a completed loop must also be the single global solution.

In an ordinary square-grid puzzle, a zero excludes every surrounding edge. If a vertex then has only two remaining possible edges and must be visited, both are forced; if it already has two included edges, every other incident edge is excluded.

A zero and a full vertex

The phrase “must be visited” matters. A loop need not visit every dot. Two undecided incident edges alone are not enough to force them if the loop can leave that vertex unused.

Before closing a small loop, check whether required edges elsewhere would remain disconnected. A locally legal turn can be globally impossible because it strands the rest of the solution outside a finished cycle.

Do not export square-grid deductions

The collection also supports triangular, hexagonal and irregular tilings. A square-grid pattern involving four sides cannot be copied blindly to a face with another number of sides or a vertex with another degree.

The manual distinguishes included edges from excluded ones. Recording an exclusion reduces ambiguity when reviewing a deduction: an untouched yellow edge means unknown, not necessarily forbidden. Reversible marks make a sequence easier to explain.

Mark excluded edges explicitly

On a small square-grid Loopy instance, start by excluding the edges around a zero. Before extending a forced pair, explain why that vertex must be visited; this separates a proof from a tempting shape.

Use the checklist to record the grid type, clue position and exact included or excluded edge. A second player can then replay the deduction instead of guessing which yellow line you meant.

Official references

References checked: . Original editorial schematic; not a captured game board.

Put it into practice

Open a detail page, check the controls and content notes, then follow the creator’s play link.

Find a game See how it works