Logic Masters Deutschland e.V.

Technically the 4th puzzle with this rule set, but this is an easier puzzle to help people learn the rules.
More difficult versions can be found here and here.
And a 5-Star 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: link

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.

Hints
If you want some hints on how to start and solve this puzzle highlight the white text below:
[HINT] 1) Start by trying to locate the locations of the snake's head and tail.

2) Clues can range from 1-7 (Inclusive):  
A clue can't be 0 spaces away from the snake end without being on it, which isn't allowed. Each clue only has 8 surrounding cells, so it can never touch more than 8 cells.  And if a clue was touching 8 snake cells it would be surrounded by a closed loop, which isn't allowed.

3) Highlight all possible cells for each map that won't immediately break one of its clues: 
It's useful to note how counting the distance from a cell results in a concentric diamond pattern (illustrated here counting out from the orange cell).  I find it easiest to count out diagonally (along the dotted line) 2,4,6,8 and visualize how the string of 8's (purple) are all unreachable, as well as anything further away (pink).

4) Consider the possible snake paths: 
As the clues get narrowed down certain cells must be included on the snake in order to achieve the clue totals, while other cells will become impassible.  Keep in mind that any two snake cells that are orthogonally adjacent must be consecutive on the snake.  Also, the only 'end points" are the two revealed by the maps, so some progress can be made just knowing that the snake must keep going to avoid a dead end.

Iterative application of the ideas above should get you at least this far after the break-in  At which point additional deductions can be made in several directions:
Where does the snake go / not go? (Add green and grey cells)
Where is the head of the snake? (Remove purple cells that are impossible)
What are the final clue values? (Remove candidates that are impossible)

Good Luck[/HINT]

Created by: Greg Rodgers Powers