Our friend the fillomino frog has discovered parity.
I do strongly recommend you complete this series of puzzles in order.
Rules
Fillomino. Divide the grid into regions of 1 to 9 cells, each filled with its size, such that no two regions of the same size share an edge.
Anti Row/Column. The digit N cannot appear in row N or column N.
Lotus Flowers. A digit on a lotus flower indicates how many lotus flowers contain that digit and how many regions there are of that size. No region can contain more than one lotus flower.
Frog's Path. Find a path for the frog to reach the mosquito such that:
Counters. In the column on the right, record how many times each digit appears on the frog's path.
Please leave a comment if you enjoy this puzzle.
Solution code: The first 12 digits on the frog's path.
on 19. June 2025, 17:16 by askaksaksask
Fun extension of the series! I think adding the parity restriction makes this entry a touch easier than the previous one, but no less fun to sort out. The breakin, and the lotus flowers, were quite fun. Excited to see what Fillomino Frog encounters next. Thank you!
Difficulty: | ![]() |
Rating: | N/A |
Solved: | 3 times |
Observed: | 0 times |
ID: | 000NTT |
Please note: The German version of this page has changed. It is possible that this page does not contain the latest information.