Back

Snake Domino Search (1252)

Instruction:
Divide some of the grid into a full set of dominoes. Each domino must be used exactly once. The orientation of the digits does not matter. Not all cells in the grid will be used.
All used cells must make 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 cannot 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.)
When two dominoes share an edge, the numbers in the cells touching that edge must be the same.
A rounded square in a cell (when provided) indicates that that cell must be an end of a snake.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2025 - Round 7 (236)
Parent puzzle:
Snake
Related puzzles:
Domino Search