Matchaluck (A Meidjuluk N=15 Variant)
(Published on 11. October 2023, 11:41 by 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
Solution code: For the cells of Row 7, the size of the regions they belong to from left to right.
Comments
on 23. September 2024, 17:21 by Snookerfan
Fantastic puzzle! Probably the hardest Meidjuluk I have solved. Incredibly beautiful. Thank you
on 3. May 2024, 15:03 by Christounet
Great puzzle ! Easy to make mistakes in the midsolve if you don't look at the clues in the right order, but it comes together very nicely with a bit of method. Thanks :)
on 3. May 2024, 12:54 by dumediat
Quite an amazing and wonderful journey this puzzle took me on. Incredibly well set, thank you very much!
on 19. February 2024, 01:08 by Tacosian
Seriously awesome puzzle. Very difficult, but completely fair and immensely satisfying when it all comes together.
on 27. January 2024, 00:11 by Zombie Hunter
This should be a CTC feature. Fair and fun puzzle with no guessing needed.
on 3. January 2024, 08:08 by Vebby
Great puzzle! Deserves a lot more solves.
~ Thank you Vebby!
on 11. October 2023, 18:44 by 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
