- Normal Sudoku rules apply, i.e. each row, column, and 3x3 region has to contain the digits from 1 to 9 once each.
- Negative Diagonal: On the negative main diagonal, digits may not repeat.
- Nabner Lines: The yellow lines are Nabner Lines, i.e. on such a line there may not be consecutive or repeated digits. For example, if a 4 lies on a Nabner line, this line may not contain another 4 and neither a 3 nor a 5.
- Ninetropy Lines: Every set of 4 adjacent digits on a hollow blue line must contain a digit from each of the pairs summing to 9, i.e. one of the subsets {1,8}, {2,7}, {3,6}, and {4,5}. A 9 may not appear on a Ninetropy line. Digits on a line may repeat if allowed by other rules.
- Up to N-sums: A clue outside the Column N indicates the sum of all digits up to the cell that contains the digit N. (The digit N itself is not included in the sum.)
Here you can solve the puzzle online:
Solution code: Row 9 from left to right (9 digits in total)
on 14. July 2025, 17:37 by puzzlepandit
Nice setting with multiple rule sets.
**
Thank you for your comment, puzzlepandit! We are glad that you liked the puzzle.
Kind regards, sujoyku
on 3. July 2025, 22:01 by softie
Great puzzle. I really enjoyed that the break-in was quite easy, which gave me an introduction to the interactions of the clues, but then before long the deductions became quite difficult and interesting. (It ended up at 4* for me.) I think that's a better experience than a really tough break-in that just leaves you staring at a blank grid. Thanks for setting!
**
You are much welcome, softie, thank you for your comment! We are glad that you enjoyed our puzzle.
Kind regards, sujoyku
on 13. June 2025, 13:44 by Leodekri
just great !
**
Thank you, Leodekri!
Kind regards, sujoyku
on 6. June 2025, 04:22 by Crusader175
Fun puzzle!
**
Thank you, Crusader175! We are glad you had a fun solve.
Kind regards, sujoyku
on 2. June 2025, 14:02 by farodin64
...und die Nabner-Linien von Box 5+6 und die von Box 7+8 könnte man jeweils zusammen gefasst als kleines "n" lesen, also insgesamt 6 Ns ;-) btw unterhaltsames Puzzle mit einem Schwierigkeitsgrad in einem guten Range!
**
Ganz genau das war die Idee, farodin64, vielen Dank für deinen Kommentar! Es freut uns, dass Dir das Rätsel gefallen hat.
Herzliche Grüße, sujoyku
on 1. June 2025, 20:49 by MSDOS
Wonderful setting, loved it! Very smooth start with some excellent logic in the mid-late solve. Thanks for sharing!
**
You are much welcome, MSDOS, thank you for your comment! We are glad that you enjoyed a smooth solve.
Kind regards, sujoyku
on 1. June 2025, 15:31 by Franjo
Sehr hübsches Puzzle, bei dem die drei „echten“ N ein schönes Sahnehäubchen bilden. Das zu lösen hat Spaß gemacht. Vielen Dank dafür.
**
Sehr gern geschehen, Franjo, vielen Dank für deinen Kommentar! Es freut uns, dass Dir das Rätsel gefallen hat. Fun fact: Die Nabner-Linien in Spalte 1 und Spalte 9 bilden mit der Diagonale ein weiteres großes N. :)
Herzliche Grüße, sujoyku
on 1. June 2025, 13:24 by Exigus
Very enjoyable, Thanks!
**
You are much welcome, Exigus, thank you for commenting! We are glad you enjoyed the puzzle.
Kind regards, sujoyku
on 31. May 2025, 22:29 by Carolin
Da hat sich ein kleiner Fehler bei den Regeln zu den Nabner-Linien eingeschlichen.
**
Oh, vielen Dank, Carolin. Das wird verbessert.
Herzliche Grüße, sujoyku
on 31. May 2025, 18:49 by ChinStrap
Quite enjoyable how all the constraints melded together
**
Thank you for your comment, ChinStrap! And also thank you very much for testing! We are glad you liked the combination of constraints.
Kind regards, sujoyku
on 31. May 2025, 18:30 by Calvinball
Very neat setting here, thank you both for this lovely treat!.
**
Thank you for your comment, Calvinball! And thanks again for testing! We are glad you enjoyed our puzzle.
Kind regards, sujoyku
on 31. May 2025, 18:16 by NEWS
Vielen Dank für diese tolle Zusammenarbeit, sujoyku! Ich freue mich auf die Zusammenarbeit mit Ihnen!
**
Sehr schön! Ich freue mich auch, weitere Rätsel mit Dir zu erstellen.
Herzliche Grüße, sujoyku
Difficulty: | ![]() |
Rating: | 98 % |
Solved: | 74 times |
Observed: | 3 times |
ID: | 000NM1 |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.