Isofill Regional Path
(Published on 9. September 2026, 13:16 by Christounet)
Here is another Isofill puzzle, this time with a path. Below you can find a list of other puzzles made with the Isofill constraint. Have fun solving!
The puzzle :
Rules :
- Isofill : divide the grid into 10 regions, each comprised of 10 orthogonally connected cells. Every cell in a region contains the same digit. All of the digits 0-9 appear in the grid.
- Regional path : draw an orthogonal path through the grid. Each region is visited at most once. A region containing the digit N has exactly N cells on the path.
- Arrows : digits on cells with arrows give the number of path cells seen in the directions combined, not including itself.
If you get stuck in the midsolve, here is a small hint that may help get unstuck (highlight to reveal) : (Think about the nature of the path and the total numbers of cells on the path. It should help determine what cells are potential candidates for the endpoints.)
Solution code: Digits on the path in columns 8 and 9.
Comments
on 25. September 2026, 07:15 by TitaniaLowe
Unbelievable puzzle, amazing puzzle, beautiful puzzle, wow
on 12. September 2026, 17:13 by Agent
Great puzzle with some cool implications of the rules!
on 10. September 2026, 06:56 by marcmees
truly wonderful puzzle. Thanks
on 10. September 2026, 05:56 by afineguy
Is it a loop or a path? The arrows instructions say loop so I'm confused. As in, is there a start and end?
---
A path. Sorry for the confusion, I will update the rules.
on 10. September 2026, 00:52 by cyddrdrd
Very cool and brilliant ending! Thanks :)
on 9. September 2026, 13:40 by Piatato
Excellent execution of a fun ruleset! :D
