Snake dissection
(Eingestellt am 28. August 2020, 10:58 Uhr von Nylimb)
Divide the grid into 6 snakes. A snake is a 1-cell wide path of orthogonally connected cells, which may not touch itself, even diagonally. Each cell with a number is the head of one of the snakes, and the number tells how many cells are in the snake.
To illustrate the rules, here is a small sample puzzle, with only 4 snakes, and its solution:
The puzzle is available on Penpa.
Lösungscode: For each row, from top to bottom, give the total number of cells in the row which are in the longest snake. (E.g. for the sample puzzle the solution code would be 33210.)
Kommentare
am 13. Juni 2022, 23:14 Uhr von Vebby
5/5 stars difficulty for me. Took me hours of staring and trial-and-error before finally hitting the right configuration. I would be curious to know the logical solve path, if any.
@Vebby: I've put my solution path in a hidden comment.
am 8. Oktober 2020, 02:39 Uhr von cdwg2000
Passing through each cell in a narrow gap is the solution to difficult problems and may require some stream of consciousness.
am 6. Oktober 2020, 09:19 Uhr von Nylimb
I'm trying to add a Penpa link, but it's not working.
Later: I finally figured out that the URL was too long, so I used tinyurl.com to shorten it. Now it works.
am 29. August 2020, 05:34 Uhr von cdwg2000
Nice!
