Fortress Fillomino - Loop (10x10)
(Published yesterday, 16:45 by yttrio)
This is my seventh 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.
LOOP:
• Draw a one-cell-wide loop of orthogonally connected cells. The loop may not touch itself, not even diagonally.
• Every Fillomino region must be either entirely on or entirely off the loop.
• Numbers in cells with arrows may be either on or off the loop, and count the total number of loop cells in the indicated direction (not including itself).
Solution code: Column 6
Last changed on -
Solved by damo_89, ThePedallingPianist, haoju, tuturitu, Piatato, palpot, Calesch, marcmees, Christounet, Jesper, Calvinball, dogfarts, cravenp
Comments
yesterday, 23:15 by Christounet
Great fun! Thanks :)
yesterday, 22:54 by marcmees
this was fun. Thanks
yesterday, 22:05 by Piatato
Awesome!
yesterday, 17:53 by ThePedallingPianist
This might have been the longest I felt clueless on a Fortress Fillomino so far, but when I started to understand how the interactions worked it flowed beautifully! Another great contribution to the series :)
yesterday, 17:43 by damo_89
Incredible to find a solved grid given how tightly these constraints interact
Very nice setting