Fortress Fillomino - Greatest Lines (7×7)
(Eingestellt am 25. September 2026, 16:45 Uhr von aqjhs)
So Dorlir kindly asked for more puzzles using the Greatest Line constraint, and I found Fortress Fillomino was the way to deliver.
-
Fortress Fillomino:
- Divide the grid into orthogonally connected regions and fill each cell with a number (not necessarily single-digit) showing the number of cells in the region to which it belongs;
- Each region must be either strictly larger than all of its orthogonal neighbours or strictly smaller than all of its orthogonal neighbours.
- Greatest Lines: On each line, there is exactly one cell whose value is greater than the sum of any other two cells on that line.
See also:
Lösungscode: Column 6, top to bottom.
Kommentare
am 29. September 2026, 16:37 Uhr von Piatato
Neat!
am 27. September 2026, 17:31 Uhr von kasperd
It was easy to find a solution (1-2 stars of difficulty), but I don't see any straightforward way to show that this solution is unique.
am 27. September 2026, 09:12 Uhr von richcard
Is there an ambiguity in the rules? I'm not sure whether a line could be 1135, for example.
Allowed: The 5 is the only cell whose value is greater than all pairs of two other cells
Not allowed: The 3 and 5 are both "greater than the sum of any other two cells" because they are greater than 1 + 1
It's my first time seeing these lines, so I may be being thick...
***
the example 1135 is a valid line since it has one digit (5) that is greater than any possible sum of two of the other digits.
a non example is 1235, because 5 itself is not greater than 2+3.
am 25. September 2026, 22:47 Uhr von Flinty
Very swish setting! :)
am 25. September 2026, 19:56 Uhr von ThePedallingPianist
Thank you for this excellent debut in the series! Lots of very fresh-feeling logic in this, loved it!
