The 10-Snake
(Published on 6. May 2022, 17:22 by GBPack)
1) Normal Sudoku rules apply.
2) The grid contains a SNAKE. The snake is a set of orthogonally connected cells with no branches. The snake may not touch itself orthogonally or diagonally. In each box, the cells that are on the snake add to 10 (this implies that the snake must reach every box). The ends of the snake are shaded green in the grid. That is, the beginning and end of the snake are r9c1 and r1c9.
3) The following is an example of a valid snake on a 6x6 grid:
You can play it here: f-puzzles. Or here: CTC-App
Solution code: Row 5 + Row 9 (18 digits)
Solved by kublai, Franjo, Greg, DamnedLight, cmb, doppelganger, Yawnus, Elliott810, robals, Steven R, butch02, galgamer, philb, KUL_solver, AvonD, codewizard, zorant, yynb2022, fca.felix.sudoku
Comments
on 7. May 2022, 09:06 by Elliott810
Very nice puzzle! Thanks:)
