Back

Snake (Myopia) (852)

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 loop around to 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.)
Arrows in a cell indicate all closest snake-filled cells to that cell along the four orthogonal directions (if there are multiple snake-filled cells of the same closest distance to the cell, there will be multiple arrows). The snakes cannot occupy cells with arrows.
The two cells containing the ends of the snake are not given.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2019 - Round 1 (132)
Parent puzzle:
Snake
Related puzzles:
Myopia