Logic Masters Deutschland e.V.

The Snake Whisperer

(Published on 28. December 2022, 15:05 by DJV)

Rules

Normal sudoku rules apply.

Killer: Digits in a cage sum to the small number in the top left corner of the cage. Digits may not repeat in a cage.

Snake: There is a 1 cell wide snake composed of orthogonally connected cells that starts and ends at the given circles. The snake may not touch itself, even diagonally. The snake must visit every 3x3 box. The digits along the length of the snake obey German Whispers rules, i.e. each digit must be at least 5 away from the cells on both sides of it along the snake. The green cell in r7c4 is not on the snake.

F-Puzzles
CtC/SudokuPad

Solution code: The first 7 digits along the snake, starting in r1c1, followed by the last 7 digits along the snake, ending in r1c9.


Solved by Lizzy01, Steven R, SKORP17, sinchai4547, Onkel_Dagobert, mathpesto, AvonD, Bjd, Calvinball, Leira, sasheo, msbjowmx1, by81996672, absolutebeginner, deltameth, nmmc123, pepe74287, 8bitlemon, ... Studernaldo, cha, abed hawila, Jaych, codewizard, DaleVandermeer, hmf213, Jodelbanane, ArnulfKoch, Felis_Timon, kamkam, PippoForte, coreng, dogfarts, redgecko, trashghost, Uhu, ManuH, karen_birgitta
Full list

Comments

on 31. December 2022, 20:01 by rugbyrefmd
This was not only my first snake puzzle to complete, but also my first three-star. Thanks for expanding my solving universe!

on 31. December 2022, 03:14 by ScatterBrain
A great puzzle, thanks!
Of note, I solved this without using the 30 of the bottom cage. The cage itself was useful, but not the value in it.

on 29. December 2022, 19:03 by farodin64
Very entertaining, thanks a lot DJV!

Last changed on 29. December 2022, 04:00

on 29. December 2022, 03:59 by Calvinball
I had a blast with this! As someone who has never attempted a snake puzzle before it was tough, but the logic was all fair.

If you've never tried a snake puzzle before give this a try!

on 28. December 2022, 21:36 by Leira
Loved it!

on 28. December 2022, 16:08 by Lizzy01
Very nice!

Difficulty:3
Rating:96 %
Solved:61 times
Observed:8 times
ID:000CG0

Enter solution

Solution code:

Login