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: Twins

Author/Opus: This is the 210th puzzle from our contributing puzzlemaster Murat Can Tonta.

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:

Difficulty: 2.5 stars

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

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.