The Fillomino Frog 3
(Eingestellt am 20. April 2025, 01:46 Uhr von Die Hard)
Our friend the fillomino frog has discovered mod-3 arithmetic.
I do strongly recommend you complete this series of puzzles in order.
Rules
Divide the grid into regions, each filled with their size, such that:
- No two regions of the same size share an edge.
- All regions are of sizes 1 to 9.
- There is at least one region of each size.
- The digit N does not appear in row N or column N.
Find a path for the frog to reach the mosquito such that:
- It always hops one cell at a time over a cell edge.
- It does not visit all 4 cells in a 2x2 area.
- It visits one cell (and only one cell) in every region.
- In every 3 cells it visits, it always visits one digit from each of the sets (1, 4, 7), (2, 5, 8), and (3, 6, 9).
Please leave a comment if you enjoy this puzzle.
Lösungscode: The first 7 digits on the frogs path.
Kommentare
am 26. April 2025, 22:30 Uhr von askaksaksask
Tough one! I like the global deductions/maths to be uncovered before you can really make progress. The negative constraint putting in quite the work here as well. Brilliant cluing. I've loved the series so far. Thank you!!
Die Hard: Thank you! Agree this one is tougher than the others. I'm not rushing to continue the series - there will only be a #4 or #5 if I I come up with something new+worthwhile (I do have a few ideas..).
am 20. April 2025, 20:28 Uhr von Snookerfan
Brilliant puzzle and series! I really like how much I needed to understand and discover before I could even start, as is the case in most of your puzzles. Thank you!
Die Hard: Thank you. Much appreciated.
am 20. April 2025, 18:46 Uhr von jessica6
Had to do quite a math before starting. And in the end I made a mistake and I had to restart from the other side to get it right, which had cost me a lot of time.
Die Hard: Thank you for going the journey and commenting. This one is tough. Well done!
