Snake Burrow
(Published on 22. April 2024, 23:15 by Suspicious Door)
- Within the grid, draw a 1 cell wide path such that both ends of the path lie along the line in row 1. This path may not touch itself orthogonally.
- The remaining cells that are not along the path must be split into 5 distinct regions, each of a unique size of 1-5 cells. Cells within a region contain the digit equal to that region's size. These regions may not touch each other orthogonally.
- Digits within a cage must sum to the number listed in the top-left corner of the cage.
Link: CTC-AppSolution code: Rows 2 and 5 separated by a "-" with 0's for path cells. Example: 201033-440555
Comments
on 27. April 2024, 03:55 by Nordy
Very cool! Difficulty between 1-2 stars for me
on 25. April 2024, 23:33 by Suspicious Door
Clarified rules after discussing with solvers.
on 25. April 2024, 12:09 by JustinTucker
My assumption is that regions have to be separated by the path, i.e. they must not touch orthogonally. So it's not a Fillomino type puzzle.
on 24. April 2024, 16:39 by Silverbyte
EDIT: After the rules clarification, this was a really nice puzzle :) Funny how it solves so logically from a pretty empty grid.
on 23. April 2024, 18:38 by JustinTucker
The solution seems to be not unique. Is there a rule missing? For example that numbers in the cage must not repeat?
on 23. April 2024, 02:31 by ONeill
Cool puzzle :) much easier than 3 stars in my opinion
