Draw a one-cell wide snake that moves orthogonally through the centres of cells and does not branch or touch itself orthogonally or diagonally.
Region borders divide the snake in to segments with the same sum. The snake may visit a region more than once.
A digit in a New Year decoration indicates how many of the up to 9 surrounding cells are on the snake, including the decorated cell. Not all possible decorations are necessarily given.
X-sum clues outside the grid indicate the sum of the first x digits in the row/column, where x is the first digit the clue sees.
Solution code: Row 7
on 6. January 2025, 20:58 by Adrian71
Wow this is an amazing puzzle! The interaction between the several constraints is just awesome, absolutely brilliant setting! I must admit it was just a little bit too hard for me, some of the deductions and logic I figured out only in hindsight. Thanks for the loads of fun!
on 6. January 2025, 01:31 by Elliott810
Brilliant puzzle (5* imo)! Thanks:)
on 4. January 2025, 22:17 by askaksaksask
This is a great snake puzzle. There is a lot of great fun balancing the tight constraint of the snake sum against the possible lantern digits. This was really a blast, thank you!
Difficulty: | ![]() |
Rating: | N/A |
Solved: | 9 times |
Observed: | 4 times |
ID: | 000LFR |