Treasure Maps Python (+ Negative Constraint)
(Published on 29. January 2021, 23:00 by Eggr)
Every possible clue is given. Otherwise the rules are the same as before.
Previous Puzzles with these rules (without the negative constraint):
Introduction puzzle
Medium: #1, #3
Difficult: #2, #4
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.
For this puzzle all possible clues are given.
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.
The negative constraint means that any unmarked cell (that isn't a part of the snake) can not touch exactly the same number of snake cells as its distance from either end of the snake.
Hint:
If you would like a small hint for starting this puzzle highlight the white text below:
[HINT] With just counting, it is trivial to narrow down the map options to 5 possible head (triangle) placements and 6 possible tail (circle) placements. If that is unintuitive I highly recommend starting with the introduction puzzle linked at the top of the page to learn the basic strategy first. [/HINT]
Created by: Greg Rodgers Powers
Previous Puzzles with these rules (without the negative constraint):
Introduction puzzle
Medium: #1, #3
Difficult: #2, #4
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.
For this puzzle all possible clues are given.
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.
The negative constraint means that any unmarked cell (that isn't a part of the snake) can not touch exactly the same number of snake cells as its distance from either end of the snake.
Hint:
If you would like a small hint for starting this puzzle highlight the white text below:
[HINT] With just counting, it is trivial to narrow down the map options to 5 possible head (triangle) placements and 6 possible tail (circle) placements. If that is unintuitive I highly recommend starting with the introduction puzzle linked at the top of the page to learn the basic strategy first. [/HINT]
Created by: Greg Rodgers Powers
Solution code: For each row enter the length of the longest continuous snake segment (Include 0's for any rows that don't have any snake)
Last changed on on 31. January 2021, 03:00
Solved by NikolaZ, Jesper, CJK, cdwg2000, jessica6, kublai, Lenne, Alex, skgoal
Comments
on 1. February 2021, 07:37 by Eggr
@Jesper Thanks, I'm glad to hear you liked it. I'll probably try to make more with the negative constraint.
They aren't as popular as sudoku's but it's been a fun series to create.
on 31. January 2021, 03:14 by cdwg2000
Very nice another,Thanks!
on 31. January 2021, 03:00 by Eggr
Solution Code Clarification:
Include zero's for any empty rows
