Fortress Fillomino - X-Sums (9x9)
(Eingestellt am 9. Oktober 2026, 16:45 Uhr von Prof.Dori)
This week I am honored to present the next puzzle to Fortress Fillomino series created by ThePedallingPianist hope you enjoy it.
click image to play this week's Fortress Fillomino
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.
X-SUMS:
• Clues outside the grid give the sum of any numbers in the first X cells from the direction of the clue, where X is the first digit in that direction.
QUESTION MARKS:
• '?'s are digits from 0 to 9 which must be determined by the solver (not necessarily different and can't have 0 as a leading digit).
Note: For answer check, enter just the ones digit for any double-digit numbers.
Lösungscode: Row 2 only last digits with dashes between borders. For example (11-222-3333).
Zuletzt geändert am 9. Oktober 2026, 21:25 Uhr
Gelöst von kasperd, Jesper, palpot, marcmees, ThePedallingPianist, Calvinball, JustinTucker, lmdemasi, Flinty, damo_89, MattYDdraig, raaaaa, dogfarts, IcyFruit, haoju, Fool on Hill, PrincessSophia, NEWS, jkuo7, MagnusJosefsson, cbossut, kangaroo, Mr_tn, DaleVandermeer, Kpn
Kommentare
am 9. Oktober 2026, 23:00 Uhr von Flinty
"Thank you for playing! :)" indeed - lol - very nice!
am 9. Oktober 2026, 21:44 Uhr von ThePedallingPianist
Thank you for contributing this to the series! I agree with kasperd that the puzzle requires some very unusual and fresh-feeling logic, which is very impressive to achieve 40 puzzles deep into a series! :)
am 9. Oktober 2026, 21:32 Uhr von marcmees
Very nice. Thanks
am 9. Oktober 2026, 18:56 Uhr von kasperd
This puzzle felt quite unusual. The logic I am used to from other Fortress Fillomino puzzles did not do much in this puzzle.
It is kind of amazing that so few clues is enough to solve the puzzle.