Isaiah's June prompt was to make a puzzle that could only be set by another prompt participant. I was assigned Flinty, and I thought what better to make than a DFM, using a constraint pioneered by sujoyku?
If you want to see all the DFM puzzles, you can use this spreadsheet link.Without further ado, here are the rules!
RULES:
1) Normal sudoku rules apply, place the digits 1-9 so that they do not repeat in any row, column, or 3x3 box.
2) Dutch Flats: Every 5 in the grid must have a '1' directly above it or a '9' directly below it. It may have both, but it doesn't need both.
3) Up to N-sums: Numbers outside the grid give the sum of the cells up to but not including N, where N is the row or column containing the clue.
Click the image to play!
Happy solving! I hope you enjoy this one! Check out all the DFM puzzles by Flinty and friends, and leave a comment if you liked it!
Lösungscode: Column 3, from top to bottom.
am 30. August 2025, 19:55 Uhr von yusuf17
Very hard, especially if you keep forgetting about DFM.
am 28. August 2025, 16:41 Uhr von Exigus
Some very interesting interactions, thanks!
am 28. August 2025, 11:44 Uhr von Snookerfan
Very nice! Thank you
am 27. August 2025, 20:08 Uhr von Calvinball
Some wonderful logical nuggets are found in here, especially when I remembered to actually apply the DFM rules lol.
am 27. August 2025, 19:36 Uhr von sujoyku
Wonderful puzzle! Thank you for this brilliant marriage of Dutch Flat Mates and the Up to N-variant!
am 27. August 2025, 19:12 Uhr von Qodec
Some nice surprises in here. Dutch flats are such a good hybrid constraint.
am 27. August 2025, 19:04 Uhr von Franjo
Elegant episode! Thank you very much for creating and sharing.
am 27. August 2025, 13:12 Uhr von Flinty
Lovely stuff Imposter Flinty. :)
| Schwierigkeit: | ![]() |
| Bewertung: | 94 % |
| Gelöst: | 67 mal |
| Beobachtet: | 3 mal |
| ID: | 000OWH |