Previous Dutch Flat Mate Puzzles
This has been a weekly series since '18 Oct 23'. Here is a spreadsheet link for all the previous puzzles in the series, which also has a few teasers for upcoming constraints/guest setters in the series (subject to change).
This alternative link offers a limited LMD search for Dutch Flat Mates.
Special Thanks
Summit Lines were created by vythic who has made multiple puzzles using this constraint.
To play the puzzle, please click the image:
Initial Setter Difficulty: 2-2.5 / 5
Normal Sudoku rules apply
Place the digits 1-9 so that they do not repeat in any row, column, or 3x3 box.
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.
Summit Lines
Digits along a line must always be strictly ascending or descending, with ascension/descension only reversing once a 1 or 9 is placed on the line.
Hint to start
All looped segments of Summit Lines must have at least one of each of 1 and 9, or the ascension/descension flow would be broken in one direction - this impacts on Flat Mates. You cannot immediately place 5 in C2, but you can at least ensure he isn't homeless.
Solution code: Row 4 Digits
on 29. July 2026, 18:48 by Vythic
Amazing.
on 29. July 2026, 16:55 by Snookerfan
Very nice! 3 stars seems fine because of the break-in. Thanks
on 29. July 2026, 15:40 by wuc
Great rule interaction. Nice break in. To me 2.5*. Great fun thx.
on 29. July 2026, 15:05 by Miatc
Normally not a huge fan of Dutch Flat Mates, but I was for this puzzle. Big fan
on 29. July 2026, 13:41 by Black_Doom
Very pretty geometry, thank you for this beauty
on 29. July 2026, 12:34 by Franjo
Thank you very much for creating and sharing another great DFM-puzzle. I don’t know what I’ve overlooked, but gave 3.5* ….
on 29. July 2026, 11:19 by Piatato
Very clean, thanks!
on 29. July 2026, 08:42 by alexsmart
Extraordinarily smooth solve! It was like a loaded gun, you could feel the tension mounting and mounting and then a very satisfying release.
| Difficulty: | ![]() |
| Rating: | 93 % |
| Solved: | 53 times |
| Observed: | 0 times |
| ID: | 000TKJ |