Back

Snaky Word Search (192)

Other names: Snaky Search

Instruction:
Locate the list of words in the grid. Each word is in the shape of a "snake" (with diagonals) in the grid. A snake is a path that starts at a letter, goes through some number of letters in any of the standard eight directions, and ends at a letter. Each letter is used at most once by a snake. A snake may not make turns sharper than 90 degrees and may not loop around to touch itself, not even diagonally. (In other words, if two letters in a snake are adjacent orthogonally, then they must be exactly one apart along the path of that snake, and if two letters in a snake are adjacent diagonally, then they must be exactly one or two letters apart along the path of that snake).
Snakes cannot touch each other, not even diagonally.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2023 - Round 7 (211)
Parent puzzle:
Word Search