Treasure Maps Python 2
(Eingestellt am 19. Dezember 2020, 10:00 Uhr von Eggr)
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:
The puzzle has been updated with two additional clues to ensure a unique solution: (Total of 9 circles and 3 triangles)
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)
Kommentare
am 23. Dezember 2020, 10:34 Uhr von cdwg2000
@Eggr
Thank you for your problem-solving process. I will compare and reason again. I think the difficulty should be 5 stars.
am 23. Dezember 2020, 10:18 Uhr von Eggr
Moved up to 5 Stars
am 23. Dezember 2020, 00:33 Uhr von cdwg2000
Very incredible! I can't find a pure logical idea at all, I hope I can see it in the hidden comment area. thank you very much!
am 20. Dezember 2020, 06:00 Uhr von Eggr
Added 2 new clues and updated the solution code to make it a unique solution.
Difficulty set back to 4 stars.
Thanks @CJK for finding an alternate solution. The solution you found is now considered the correct solution, and it should be unique.
am 20. Dezember 2020, 03:50 Uhr von Eggr
Increased Difficulty Rating
