Logic Masters Deutschland e.V.

Sudoku Variants Series (208) - Snakes Sudoku

(Published on 21. November 2017, 00:00 by Richard)

For this Sudoku Variants Project I have planned to publish a different Sudoku variant every Tuesday. I will see how long it takes before I am running out of ideas.

Snakes Sudoku
Place the digits from 1 to 9 in every row, column and 3x3-block. Connect two equal digits N in grey cells so that different snakes of length (N+2) are formed, each of them with the two digits N as head and tail. A snake cannot touch itself, not even diagonally. Snakes may touch each other, without crossing and overlapping. All digits between head and tail must be different and may contain digit N.

Inspiriation for this type comes from Riad Khanmagomedov: September Sudoku Contest.

Solve online in F-Puzzles or CtC-app (thx Nick Smirnov!)

Solution code: Row 7, followed by column 7.

Last changed on on 19. August 2022, 05:26

Solved by azalozni, jirk, marcmees, Statistica, Luigi, KlausRG, MaM, jessica6, cornuto, zhergan, sloffie, dm_litv, Rollo, flaemmchen, zorant, derwolf23, moss, Senior, rcg, CHalb, AnnaTh, tuace, rob, ch1983, ... Krokant, Nick Smirnov, misko, bbutrosghali, smartmagpie, snowyegret, Greg, AMD, TomBradyLambeth, Angelo, yynb2022, Nylimb, Nickyo, Uhu, mjozska1985, juventino188, martin1456, karen_birgitta
Full list

Comments

on 19. August 2022, 05:26 by Richard
Added links and tag for online solving. Thx Nick!

on 25. September 2021, 20:34 by Nick Smirnov
f-puzzles:
https://f-puzzles.com/?id=yh46mgwh

CTC App:
https://tinyurl.com/ydkuh8p6

on 16. December 2017, 13:30 by pin7guin
Diese Variante hat mir sehr gut gefallen! Danke, Richard!

on 23. November 2017, 12:24 by ibag
Sehr schoen!

on 22. November 2017, 11:52 by AnnaTh
Fantastic!

on 21. November 2017, 09:31 by Luigi
Diese Sudoku Variante hat mir sehr gut gefallen!

on 21. November 2017, 09:26 by Statistica
Seeehr hübsch. Danke.

on 21. November 2017, 01:53 by jirk
Diese Variante hat mir ganz besonders gefallen!

Difficulty:3
Rating:92 %
Solved:89 times
Observed:11 times
ID:0002PJ

Puzzle variant Online solving tool

Enter solution

Solution code:

Login