Treasure Maps Python 3
(Eingestellt am 22. Dezember 2020, 10:00 Uhr von Eggr)
Same Rules; similar difficulty to
the first puzzle or if you want a challenge try
the second one
Rules:
All cells with the same shape are clues on a "treasure map", where the value of each clue denotes its distance from a hidden cell.
The Triangle map points to the head of a snake. The Circle map points the tail of a snake.
Place a snake into the grid connecting the head to the tail.
Diagonal touching is allowed
Each clue
also indicates how many of the 8 surrounding cells are part of the snake
Clues can not be on the snake.
Treasure Map Example:
Puzzle:
Penpa Link to solve online
Disambiguation:
A snake is a 1-cell wide path of orthogonality connected cells, starting at the 'head' and leading to the 'tail'.
The snake never touches itself orthogonally, but
may touch diagonally.
The snake never 'doubles-back' to cover a 2x2 region.
Created by: Greg Rodgers Powers
Lösungscode: Number of Snake cells in each row. (Example: 13310)
Zuletzt geändert -
Gelöst von H1324851344, cdwg2000, CJK, NikolaZ, jessica6, dandbdi, Jesper, Dandelo, SudokuExplorer, sandmoppe, moss, Circleconstant314, Isa, juventino188, bernhard, geronimo92, euklid, sudocolor, Jds2, ... Faultier, Duarte, Farkov, Obcerd, cfop, skgoal, Phlyers, kublai, zorant, Uhu, michaal94, wawawawa, Mark Sweep, Shashkov26, CHalb, Zzzyxas, hurrdurr, zhergan, OGRussHood, Johan, Gotroch