Hakyuu (WPC 2019 Leftover)
(Published on 18. November 2019, 15:00 by uvo)
Enter numbers into the grid, so that each region of size N contains numbers from 1 to N, each number exactly once. If the same number appears multiple times within a row or column, the number itself indicates the minimum distance between these numbers: each pair of equal numbers X in the same row or column must be separated by at least X other cells between them.
Solution code: The marked rows.
Last changed on on 18. November 2019, 20:03
Solved by Realshaggy, Alex, Joe Average, CHalb, saskia-daniela, Rollo, moss, jessica6, adam001, jirk, Quetzal, Statistica, flaemmchen, zuzanina, Krokant, rimodech, dm_litv, rob, marcmees, ch1983, Dandelo, ... athin, synth, glum_hippo, misko, NogBolog, geronimo92, rubbeng, Nusi, Joo M.Y, Voyager, chrisbee2, Danielle, bernhard, brimmy, Raistlen, apiad, RobertBe, Mark Sweep, lutzreimer, garganega
