### Snake Pit X by Takeya Saikachi

0 Flares 0 Flares

PDF

or solve online (using our beta test of Penpa-Edit tools; use tab to alternate between number entry, line drawing, and edge drawing.)

Theme: X Box

Author/Opus: This is the 2nd puzzle from guest contributor Takeya Saikachi.

Rules: Divide the grid along the boundary lines so that every cell belongs to a snake. A snake is a one-cell-wide path at least two cells long that does not touch itself, not even diagonally. Circled cells must be at one of the ends of a snake. A snake may contain one circled cell, two circled cells, or no circled cells at all. Numbered cells must be part of a snake with a length of exactly that number of cells. A snake may contain one number, multiple identical numbers, or no numbers at all. Two snakes of the same length cannot touch each other horizontally or vertically. Cells with an X cannot be an end of a snake.

Also see this example:

Answer String: For each cell in the marked rows/columns, enter the length of the snake it belongs to. Enter just the last digit for any two-digit number. This example has the key “33553,44664”.

Time Standards (highlight to view): Grandmaster = 1:00, Master = 1:30, Expert = 3:00

Solution: PDF

Note: Follow this link for other Snake puzzles.

• Grizix says:

I think that the answer string description is not clear. The example’s answer string should be enough to understand.
I thought it was 221,221.