Snake Pit by Serkan Yürekli

0 Flares Filament.io 0 Flares ×

Snake Pit by Serkan Yürekli

PDF

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

Theme: Diamonds

Author/Opus: This is the 342nd puzzle from our managing editor Serkan Yürekli.

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.

Also see this example:

Snake Pit by Carl Worth

Difficulty: 2.5 stars

Time Standards (highlight to view): Grandmaster = 2:30, Master = 4:00, Expert = 8:00

Solution: PDF; a solution video is also available here.

Note: Follow this link for more Snake Pit puzzles. Follow these links for other Fillomino or Snake puzzles.

Leave a Reply

Your email address will not be published.

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