Logic Masters Deutschland e.V.

Fortress Fillomino - Up to N Sums (10x10)

(Published on 4. September 2026, 16:45 by Flinty)




Special Thanks
This puzzle was a collab with palpot, and we are both very proud to create our second entry for ThePedallingPianist's wonderful series!

Initial Setter Difficulty: 2-2.5 / 5


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.

UP TO N-SUMS:
• A clue outside the Row or Column N indicates the sum of all cells up to the cell that contains the first appearance of number N. (N itself is not included in the sum.)

Solution code: Column 1

Last changed on -

Solved by Jesper, ThePedallingPianist, marcmees, damo_89, palpot, Piatato, Mr_tn, tuturitu, Mr. Happy, Christounet, achim-t, Calesch, dogfarts, booteskey, sorryimLate, rcg, kangaroo, unlogical, JVA, kasperd, jkuo7, Firebird, Franjo, Miatc, Kpn
Full list

Comments

yesterday, 18:23 by Franjo
Thank you very much for creating and sharing another lovely FFF-puzzle. Excellent setting!

yesterday, 17:09 by kasperd
The ending was neat.

Once there was around 10 cells left to fill in I thought this cannot possibly have a unique solution. And then I discovered the little detail I had missed.

I don't know how you came up with that ending. (I don't know how you came with the rest of the puzzle either.)

Really nice puzzle. I found the difficulty to be in the easy end of two star puzzles.

yesterday, 01:25 by Christounet
Fun puzzle! Thanks :)

on 4. September 2026, 22:50 by Piatato
Fun!

on 4. September 2026, 20:05 by marcmees
solves like a refreshing waterfall. Thanks.

on 4. September 2026, 17:55 by ThePedallingPianist
The flow in this puzzle is absolutely wonderful! I had a smile on my face from start to finish! Thanks for another fantastic contribution to the series :)

Difficulty:2
Rating:98 %
Solved:25 times
Observed:1 times
ID:000UFF

Enter solution

Solution code:

Login