Treasure Maps Python 4
(Eingestellt am 2. Januar 2021, 05:35 Uhr von Eggr)
Same Rules. Another challenging one.
An introductory puzzle for this ruleset is here
Easier versions can be found here and here.
The other Challenge: here
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: link
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.
Created by: Greg Rodgers Powers
An introductory puzzle for this ruleset is here
Easier versions can be found here and here.
The other Challenge: here
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: link
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.
Created by: Greg Rodgers Powers
Lösungscode: Number of Snake cells in each row. (Example: 13310)
Gelöst von CJK, Dandelo, H1324851344, NikolaZ, cdwg2000, Jesper, jessica6, Lenne, Farkov, zorant, hurrdurr
