Back

Snaky Loop (Nonogram) (1061)

Instruction:
Locate a "snaky loop" in the grid; it goes through some number of cells orthogonally and comes back to itself. Each cell is used at most once by the loop. The loop must occupy more than four cells and may not touch itself, not even diagonally. (In other words, if two cells in the loop touch orthogonally, then they must be exactly one cell apart along the path of the loop, and if two cells in the loop touch diagonally, then they must be exactly two cells apart along the path of the loop.)
The numbers to the left of (and above) the main grid represent the lengths of contiguous empty cell blocks in the corresponding row (or column). The lengths are given in order from left to right (or top to bottom), and cell blocks must contain at least one "snake" cell between them.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2022 - Round 5 (185)
Parent puzzle:
Snaky Loop (Regions)