Crypto Snake Pit
(Published on 23. December 2025, 16:46 by KNT)
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. Colored cells must be at one of the ends of a snake. Two snakes of the same length may not touch orthogonally.
Clued cells must be part of a snake with a length of exactly that number of cells. Same letters replace the same number, different letters replace different numbers.
Snakes may have any amount of any type of clue.
An unencrypted 7x7 example is provided:
Clued cells must be part of a snake with a length of exactly that number of cells. Same letters replace the same number, different letters replace different numbers.
Snakes may have any amount of any type of clue.
An unencrypted 7x7 example is provided:
Solution code: The sizes of the snakes in Row 10 (13 numbers)
Last changed on on 10. January 2026, 21:11
Solved by Piatato, Myxo, Nick Smirnov, cyddrdrd, Jesper, Paletron, widjo, Mr_tn, CutieRainbow, Tom-dz, dogfarts, han233ing, misko, MagnusJosefsson, elmers, puzzler05, the_fat_goose, Agent
Comments
on 15. February 2026, 12:16 by Agent
Great fun! This ending was cool and unexpected.
on 21. January 2026, 15:31 by MagnusJosefsson
Fantastic!
on 25. December 2025, 15:34 by Jesper
Very nice, thanks!
Last changed on 24. December 2025, 21:11
on 24. December 2025, 21:11 by cyddrdrd
I don’t like snakesssssssss but I love this one!
Last changed on 24. December 2025, 00:25
on 24. December 2025, 00:23 by Myxo
holy snakes
on 23. December 2025, 22:52 by Piatato
Good fun, thanks!
