Back

Snake (Memory) (1069)

Instruction:
Locate a "snake" in the grid. The snake is a path that starts in a cell, goes through some number of cells orthogonally, and ends in a cell. Each cell is used at most once by the snake. The snake may not touch itself, not even diagonally. (In other words, if two cells in the snake touch orthogonally, then they must be exactly one cell apart along the path of the snake, and if two cells in the snake touch diagonally, then they must be exactly two cells apart along the path of the snake.)
Some areas of the grid are marked with shaded polyominoes. Every polyomino must be visited by the snake. Polyominoes that have the same shape and orientation must be visited by the snake in exactly the same way, including where the snake enters and leaves.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2022 - Round 6 (186)
Parent puzzle:
Snake