Rules:
ISOFILL: Divide the grid into 10 regions, each with 10 orthogonally connected cells. Every cell in a region must contain the same digit. All of the digits 0-9 must appear in the grid.
REGION SUM LINES: Blue lines are divided into at least two segments by region borders. Each segment on a line has the same sum, but this sum may be different for different lines.
Lösungscode: Column 5 reading downwards
am 26. September 2026, 18:30 Uhr von amirs
I started this a few weeks ago and didn't quite know how to approach this after pencil marking a few lines. Tried giving it a fresh look now and it all became clearer and flowed so nicely.
am 2. September 2026, 18:38 Uhr von davidz32z
I keep thinking I'll surely get stuck and frustrated by an isofill and they keep surprising me! These have been so fun!
am 20. August 2026, 17:07 Uhr von mscha
Whew! It took me 6 days to find the break-in. And then maybe 15 minutes to finish the puzzle.
5 stars for me. Very nice though.
am 16. August 2026, 18:32 Uhr von Klausku
Very nice. And brilliantly set, again. Thanks Marty!
After I did the first isofill puzzle (with the kropkis), I thought that region sum lines might be very interesting along isofill. I thought of a break in and was now quite surprised that I could use it here.
am 15. August 2026, 02:23 Uhr von raaaaa
A nice puzzle! And the ID SUM is also interesting.
am 14. August 2026, 19:15 Uhr von palletpusher
Delightful how the dangling ambiguity from near the beginning of digit placement was resolved by the absolute final cell
am 14. August 2026, 19:13 Uhr von sujoyku
Isofill and RSL are a perfect match. Thank you for this beautiful puzzle, Marty!
am 14. August 2026, 18:55 Uhr von Christounet
Again, such a cool genre! Love the design of the logo too. Thanks :)
am 14. August 2026, 16:54 Uhr von Franjo
Thank you so much for creating and sharing another incredible puzzle. Again you made me lost for words …
am 14. August 2026, 15:25 Uhr von gasp141424
A lovely break in, and funny to see how a 0 resolves itself in this kind of puzzle.
| Schwierigkeit: | ![]() |
| Bewertung: | 95 % |
| Gelöst: | 175 mal |
| Beobachtet: | 4 mal |
| ID: | 000SUM |