by Md88keys
Play in Sudokupad
Chaos construction: Create nine orthogonally connected regions that do not overlap. Two borders are given in column 3. Place the digits 1-9 in every row, column, and region.
Extreme Limitations Rules: All clue types (rules 1-4 below) include the digits 1-9 without repeat, and each digit belongs to a different region.
Region Parity Rule: All four clue cells in a region have the same parity (even or odd).
1. Digits on a thermometer increase from the bulb to the tip.
2. Digits in a cage sum to the number given.
3. Adjacent pairs or trios of digits on a teal line must be from different modular sets (147, 258, 369).
4. Digits in a gray circle are odd and digits in a gray square are even (thermometer bulbs are not gray circles).
Solution code: 10 digits: The number of regions in column 7 and then column 7 top to bottom.
on 15. July 2025, 20:14 by elpadrinoIV
It started flowing super nice. Then I got stuck for quite some time. Then I re-read the rules and found the Region Parity Rule, and things started flowing super nice again.
Beautiful puzzle, thanks for setting!
on 15. July 2025, 17:55 by Tilberg
@jerbear29: I feel you ... ;-)
on 15. July 2025, 17:46 by BorisP2101
What a lovely puzzle, thanks!
on 14. July 2025, 23:28 by jerbear29
Enjoyable. From personal experience, it helps to read ALL the rules and not accidentally skip the 'Region Parity Rule'.
on 14. July 2025, 21:05 by blackjackfitz
loved that, thanks
on 14. July 2025, 02:07 by deltameth
Thank you for a very enjoyable puzzle!
The solution was so smooth… I feel that there might be too many clues. I can’t prove it but with less clues the solution could be unique as well, though it wouldn’t be that smooth.
on 13. July 2025, 22:03 by Exigus
The global rules worked very well together for the CC. Much enjoyed. Thanks!
on 13. July 2025, 11:22 by Snookerfan
Beautiful puzzle and series! I found this one really smooth. Thank you
on 13. July 2025, 07:23 by Elliott810
As brilliant as hard! Thank you:)
on 12. July 2025, 22:57 by CitrusGremlin
Wow... what a puzzle. Not sure I'd classify this as five stars because normally five stars are beyond me but this was absolutely excellent.
Difficulty: | ![]() |
Rating: | 94 % |
Solved: | 90 times |
Observed: | 3 times |
ID: | 000O71 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.