Logic Masters Deutschland e.V.

Fortress Fillomino - Hitlines (11x11)

(Published on 18. September 2026, 16:45 by ThePedallingPianist)




It seems only fitting that I should follow up last week's debut appearance for Marty Sears in this Fortress Fillomino Fridays series last week with a very late response to a Setting Saturdays prompt that he redeemed on 25th July, for which he requested puzzles using Hitlines. Many thanks to him, and of course to Scojo for hosting one of the top two puzzle series with a day of the week in its title.


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.

HITLINES:
• A number, N, on a line is considered a hit if it is in the Nth position along that line, where the cell containing the diamond is in the 1st position;
• The sum of all hits on a line appears as a number in at least one position along each line, but never as a hit (i.e. at least 2 numbers must hit and sum to a different number);
• Numbers can repeat on a line if allowed by other rules, and there is no constraint on numbers that are neither hits nor the sum.

Solution code: Column 11 (rightmost), top to bottom

Last changed on today, 02:38

Solved by Flinty, yttrio, Franjo, dogfarts, Jesper, kasperd, earthpuzzles, haoju, raaaaa, Piatato, TalkingFredish, Christounet, Agent, han233ing, Kpn
Full list

Comments

today, 03:42 by Christounet
That one was hard! But very fun and quite miraculous in the end. Thanks :)

yesterday, 19:47 by Piatato
Cool!

yesterday, 01:28 by kasperd
This is probably the hardest puzzle yet in this series. And I am not entirely sure my deductions towards the end were all sound even though I found the solution.

on 18. September 2026, 20:53 by Franjo
What a finish! Thank you very much for creating and sharing this wonderful masterpiece of a FFF-puzzle. Wow!

on 18. September 2026, 17:13 by Flinty
Beautiful puzzle! Very tricky boi indeed! :)

on 18. September 2026, 17:12 by yttrio
This one was a substantial step up in difficulty from most of the series for me, and it was kind of astounding how things managed to resolve in the end :)

Difficulty:5
Rating:98 %
Solved:15 times
Observed:1 times
ID:000TPO

Enter solution

Solution code:

Login