Back

Antidomino Snaky Loop (385)

Instruction:
Locate a “snaky loop” composed of a full set of dominoes (without doubles) 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 cell in the loop must contain half of a domino. Domino halves that contain the same number may not be in the same row nor the same column. They also may not touch at a corner. Numbers are always right-side-up regardless of the orientation of its domino. A full set of dominoes will be provided for your convenience; the smallest and largest numbers on the dominoes may change from puzzle to puzzle.
The outer clue for each row (or column), when given, tells you the number of cells in that row (or column) that are part of the loop. The inner clue, when given, tells you the sum of the numbers of all domino halves in that row (or column). The contents of some cells has been given to you.

Reference: WPF (1)

Examples:
WPF Puzzle GP 2018 - Playoffs (123)
WPF Puzzle GP 2018 - Round 5 (55)
Related puzzles:
Snaky Loop (Regions)