The Fillomino Frog 2
(Published on 1. March 2025, 23:51 by Die Hard)
Our friend the fillomino frog hops again!
Rules
Divide the grid into regions of 1 to 9 cells, each filled with their size, such that no two regions of the same size share an edge.
Find a path for the frog to reach the mosquito such that:
- It always hops orthogonally one cell at a time.
- In every 3 cells it visits, it always visits a low (1, 2, 3), middle (4, 5, 6), and high (7, 8, 9) digit.
- Adjacent pairs of digits on the path sum to a prime.
- It never visits the same fillomino region more than once.
Please leave a comment if you enjoy this puzzle.
Solution code: The nine digits in column nine.
Comments
on 2. March 2025, 21:08 by askaksaksask
I think this is really, really well done. There is certainly some global work to ponder before you can dive in, and i don't think the global theorems are immediate either. For that reason I might place this at 4*, but mileage may vary. Otherwise, a beautiful and fun puzzle that rewards some prerequisite, first principles logic with a much more accessible solve path. Thank you for this!
on 2. March 2025, 11:31 by Snookerfan
Very nice puzzle! Understanding the implications of the constraints was all I needed for an incredibly smooth solve. Very well set and a must solve for people who are not to familiar with filomino. Thank you
