Back

Snakes (365)

Instruction:
Locate many "snakes" in the grid. A snake is a path that starts in a cell, goes through some number of cells orthogonally, and ends in a cell. A snake cannot go through any cells marked with '×'. Each cell is used at most once by any snake. A snake may not loop around to touch itself or touch other snakes, not even diagonally. (In other words, if two cells in any snakes touch orthogonally, then they must be exactly one cell apart along the path of the same snake, and if two cells in any snakes touch diagonally, then they must be exactly two cells apart along the path of the same snake.) Numbers outside the grid, if given, indicate how many cells in that row or column are occupied by snakes.
The cells containing the ends of all snakes are shaded.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2018 - Round 3 (53)
Parent puzzle:
Snake

Child puzzles:
Double Snake