### Snake Pit X by Shinichi Aoki

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: Eight 8s

Author/Opus: This is the 1st puzzle from guest contributor Shinichi Aoki.

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 = 3:15, Master = 5:30, Expert = 11:00

Solution: PDF

Note: Follow this link for other Snake puzzles.

• skynet says:

Nice puzzle. Has to tweak a minor error at the end of my solve.

This site uses Akismet to reduce spam. Learn how your comment data is processed.