- Normal sudoku rules apply, i.e. each row, column, and 3x3 region has to contain the digits from 1 to 9 once each.
- Dutch Flat Mates: Each 5 in the grid either has a 1 directly above or a 9 directly below it. (It may have both, but it does not need both.)
- Spooky Division Lines: On each line in the grid, the digits must sum to exactly 81. Moreover, box borders divide lines into segments. If two segments are on the same line, their sums differ by 1 or less (even if the segments are not adjacent).
Here you can solve the puzzle online:
Solution code: Row 7 from left to right (9 digits in total)
on 2. May 2025, 18:29 by yusuf17
Pro tip: read the rules.
The 2-digit number is very important.
**
Thank you for your comment, yusuf17! Your pro tip is a useful one. I hope you had a fun solve.
Kind regards, sujoyku
on 2. May 2025, 13:54 by Lenivaya_Joppa
Thank you for this nice puzzle, dear sujoyku! :)
**
Thank you for your kind comment, Lenivaya_Joppa!
on 1. May 2025, 19:26 by damo_89
Spookiest bit was failing to read all the rules at the beginning :D
**
Thank you for commenting, damo_89! I think I don't mind that it was not too spooky for you. :)
Kind regards, sujoyku
on 1. May 2025, 12:19 by Franjo
Schon wieder eine wunderschöne Konstruktion mit einer witzigen Idee! Heißen Dank für das tolle Puzzle!
**
Sehr gern geschehen, Franjo, vielen Dank für deinen Kommentar! Es freut mich, dass Dir diese Variante gefallen hat.
Herzliche Grüße, sujoyku
on 30. April 2025, 23:18 by MSDOS
Fun combination of constraints! Quite enjoyed the logic throughout! Thanks for setting!
**
You are much welcome, MSDOS, thank you for your comment! I am glad you enjoyed the logic in this puzzle.
Kind regards, sujoyku
on 30. April 2025, 17:24 by Crusader175
Fun puzzle!
**
Thank you, Crusader175!
on 30. April 2025, 13:40 by Flinty
One Dutch Flat Mates puzzle for every cell in the grid, what a time to be alive!! Thank you so much for this lovely puzzle.
**
Yes, 9x9 Dutch Flat Mates puzzles! Who would have thought?
Thank you for your nice comment, Flinty!
Kind regards, sujoyku
Difficulty: | ![]() |
Rating: | 94 % |
Solved: | 93 times |
Observed: | 5 times |
ID: | 000N4P |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.