- Normal sudoku rules apply, i.e. each row, column, and 3x3 region has to contain the digits from 1 to 9 once each.
Each line in the grid is both a Tentropy and an Equal Split Line.
- Tentropy Lines: Every set of 4 adjacent digits (those might cross dots) on a hollow peach line must contain a digit from each of the X-pair (ten-pair) subsets of {1,9}, {2,8}, {3,7}, and {4,6}. A 5 may not appear on a tentropy line. Digits on a line may repeat if allowed by other rules.
- Equal Split Lines: Dots split peach lines into segments with equal sums. Digits may repeat on lines but not within a segment. Different lines may have different sums. For example, a valid Equal Split Line could read 1234-127.
Here you can solve the puzzle online:
Solution code: Column 9 from top to bottom (9 digits in total)
on 28. April 2025, 07:41 by Lenivaya_Joppa
Thank you for this nice puzzle, dear sujoyku and MSDOS! :)
**
You are much welcome, Lenivaya_Joppa, thank you for commenting! We are glad you enjoyed the puzzle.
Kind regards, sujoyku
on 16. April 2025, 15:58 by ChinStrap
Loved it!
**
Thank you, ChinStrap!
on 28. March 2025, 14:06 by Franjo
Mir ging es genauso wie Snookerfan! (Meine Dummheit.) Die Kombination der beiden Linien-Typen funktioniert hervorragend - insbesondere bei so einem perfekten Setting! Vielen Dank für das tolle Puzzle.
**
Sehr gern geschehen, Franjo, vielen Dank für deinen Kommentar! Wir freuen uns, dass Dir unser Rätsel gut gefallen hat.
Herzliche Grüße, sujoyku
on 28. March 2025, 09:56 by Snookerfan
Very nice! If only I hadn't forgotten that digits on an equal split line can not repeat within a segment, I could have saved a lot of time. When I finally remembered that, the solve became ultra smooth. Thank you
**
You are much welcome, Snookerfan, thank you for your comment! We are glad that you had a smooth solve. The "no repeats inside segments" definitely is important. I hope it did not give you too much trouble at first.
Kind regards, sujoyku
on 27. March 2025, 23:06 by MSDOS
I had such a wonderful time collaborating on this puzzle! Also, thanks to @gdc for the templating for ESLs.
**
Thank you, Matt! I can only reply in kind. Working with you on this one has been a blast. I am looking forward to setting more together.
Difficulty: | ![]() |
Rating: | 94 % |
Solved: | 49 times |
Observed: | 4 times |
ID: | 000MM8 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.