Matchaluck (A Meidjuluk N=15 Variant)
(Eingestellt am 11. Oktober 2023, 11:41 Uhr von PrimeWeasel)
Divide the grid into N regions, one of each size 1 to N. A region may not contain repeated numbers, and it may only contain factors of its size (e.g. a region of size 6 may contain any combination of 1,2,3, and 6, including none of them).
Digits in cells indicate the count of different regions touching that cell orthogonally and diagonally, other than the region the cell is in itself.
Penpa
Lösungscode: For the cells of Row 7, the size of the regions they belong to from left to right.
Gelöst von mormagli, MonsieurTRISTE, Lizzy01, Jesper, jkuo7, misko, Catlover, Vebby, Zombie Hunter, Tacosian, Paletron
Kommentare
am 19. Februar 2024, 01:08 Uhr von Tacosian
Seriously awesome puzzle. Very difficult, but completely fair and immensely satisfying when it all comes together.
am 27. Januar 2024, 00:11 Uhr von Zombie Hunter
This should be a CTC feature. Fair and fun puzzle with no guessing needed.
Zuletzt geändert am 3. Januar 2024, 10:16 Uhr
am 3. Januar 2024, 08:08 Uhr von Vebby
Great puzzle! Deserves a lot more solves.
~ Thank you Vebby!
Zuletzt geändert am 12. Oktober 2023, 21:01 Uhr
am 11. Oktober 2023, 18:44 Uhr von mormagli
I found this puzzle to be challenging but fair right up until the end... Where it finally unravels in a very satisfying way.
~ Thanks for solving mormagli
