Back

Snaky Station Loop (358)

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 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.)
Each tent is orthogonally adjacent to exactly one cell of the loop (representing a “station”). Stations may not be adjacent to each other, not even diagonally. Tents may not share stations.
The loop may not go through any cell containing a tree.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2018 - Round 2 (52)
Related puzzles (1):
Bosnian Loop
Snake

Related puzzles (2):
Snaky Loop (Regions)