Back

Arukone (11)

Other names: Numberlink

Instruction:
Some cells in the grid are marked with numbers; each number appears exactly twice and no cell contains more than one number. For each pair of identical numbers, draw a path that connects those two numbers. The paths must go through orthogonally adjacent cells. Each cell may be visited by at most one path, and may be visited at most once by that path. (It is permissible for a cell to not be visited by any path.)

Reference: WPF (1)

Examples:
WPF Puzzle GP 2014 - Round 3 (89)
WPF Puzzle GP 2014 - Round 4 (90)
WPF Puzzle GP 2015 - Round 8 (86)
WPF Puzzle GP 2017 - Round 4C (14)
WPF Puzzle GP 2017 - Round 5B (15)
WPF Puzzle GP 2018 - Round 3 (53)
Child puzzles:
Arukone (Filled)
Arukone with Crossings
Hungarian Numberlink
Sum Numberlink