Meandering Numbers

From WPC unofficial wiki
Revision as of 04:15, 22 December 2019 by EctoPLASMA (talk | contribs) (Created page with "==Rules== {{Examples|Meandering Numbers}} Place a number into each empty cell so that each cell has exactly one number and cells that contain the same number do not touch eac...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Rules

Meandering Numbers Example.png Meandering Numbers Example Solution.png

Place a number into each empty cell so that each cell has exactly one number and cells that contain the same number do not touch each other, not even diagonally. Each outlined area must contain the numbers from 1 to N (where N is the size of the outlined area in cells) such that consecutive numbers within an outlined area are orthogonally adjacent. (In other words, for each region it must be possible to draw a path that starts at 1 and ends at N, going through each other cell exactly once and in numerically increasing order.)

(Rules and example from PGP IB)

History of the puzzle

Invented by Daisuke Takei (Japan) in 2014. First appeared on Japanese round of 2014 Puzzle Grand Prix as "Count Number" The name Meandering Number was first given in Toketa volume 2 (2014).

Appearances in the past WPCs