Ice Fillomino
(Published yesterday, 09:00 by Agent)
Divide the grid into orthogonally connected regions such that no two regions of the same size share an edge, and enter a number into each cell equal to the size of its region.
The region borders form a single loop that travels orthogonally on some edges in the grid (possibly including some edges along the perimeter of the grid). The loop may not turn on icy vertices, and may cross itself only on icy vertices.
Example Puzzle (5x5)
Main Puzzle (8x8)
Solution code: The number of vertical edges used by the loop in each row, from top to bottom. (For the example puzzle, the solution code would be 24442.)
Comments
today, 08:59 by Christounet
Fun little snack! Thanks :)
yesterday, 22:19 by Piatato
Very smooth!
yesterday, 13:21 by Franjo
Thank you very much for creating and sharing this beautiful and interesting puzzle. At first I had some problems to get my head around this unusual ruleset. But then I found the smooth path - so satisfying!
yesterday, 11:05 by cyddrdrd
Clever and great fun!
