Logic Masters Deutschland e.V.

Fortress Fillomino - Slingshots (8x8)

(Eingestellt am 12. Juni 2026, 16:45 Uhr von yttrio)




This is my fourth contribution to the series started by ThePedallingPianist.


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.

SLINGSHOTS:
• For any given arrow, the number in the cell connected to its tail also appears N cells away in the direction of its tip, where N is the number in the arrow's cell.
• For example, if r1c1 was 5 and r2c1 was 3, then r1c6 would be a 3.

Lösungscode: Row 7, left to right

Zuletzt geändert -

Gelöst von ThePedallingPianist, tuturitu, Jesper, Christounet, Ambrose, Piatato, dogfarts, JennaStella, Calesch, SKORP17, fkib, damo_89, NXTMaster, Counterfeitly, isajo4002, Bravissimo, salsais, marcmees, ... Mr_tn, Joyofrandomness, MagnusJosefsson, arauwer, widjo, kasperd, Shmartus, PafPaf, jobs2554, Khepri, misko, karlmortenlunna, KNT, saulg39, Flinty, ralphwaldo1, hurrdurr, alconja, bernhard
Komplette Liste

Kommentare

am 25. Juni 2026, 00:53 Uhr von Flinty
Very nice. :)

am 24. Juni 2026, 16:10 Uhr von KNT
great!

am 24. Juni 2026, 15:56 Uhr von KNT
great!

am 13. Juni 2026, 11:51 Uhr von Franjo
Thank you very much for creating and sharing another amazing FFF-puzzle. Fantastic!

am 13. Juni 2026, 00:20 Uhr von NXTMaster
For this being my first ever fortress fillomino, it wasn't too bad. I was extremely slow at getting the hang of it, though. Thanks

am 12. Juni 2026, 23:20 Uhr von damo_89
Gorgeous. One point where I thought I broke the puzzle, very sneaky :)

am 12. Juni 2026, 20:45 Uhr von Ambrose
Thoroughly enjoyable!

Schwierigkeit:2
Bewertung:97 %
Gelöst:51 mal
Beobachtet:0 mal
ID:000T8X

Rätselvariante

Lösung abgeben

Lösungscode:

Anmelden