Logic Masters Deutschland e.V.

Kropki Snake II (Anti-Knight-Constraint)

(Published on 14. February 2021, 14:03 by Video Floral)

This puzzle is similar to my last one. However, this time I tried to interweave the Kropki mechanics with the snake clues more strongly.

This puzzle is available online via F-Puzzles

1) Normal sudoku rules apply.

2) Kropki sudoku rules apply: Cells separated by a black dot have a 1:2 ratio, cells seperated by a white dot have a difference of 1. (No negative constraints apply.)

3) Any two cells separated by a knight's move (in chess) cannot contain the same digit.

4) Cells marked with a large square or a large circle are “clues” where the value in the cell is the “distance” from the head / tail of a snake hiding in the grid. (Distance is measured as ‘number of orthogonal steps’.)
The snake is a 1-cell wide path of orthogonally-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.)
The Square map points to the head of the snake. The Circle map points the tail of a snake. Each 'clue' also indicates how many of the 8 surrounding cells are part of the snake. Clues cannot be on the snake. (See example)

Example:

Solution code: Row 1, then Column 9


Solved by NikolaZ, bigger, cdwg2000, polar, ElimGarak, Jesper, henrypijames, zuzanina
Full list

Comments

Last changed on 15. February 2021, 17:02

on 15. February 2021, 16:58 by henrypijames
Turn out, you don't need the snake! Head and tail can be determined without thinking (much) about where the body goes - and after that it's just an anti-knight sudoku (again, not needing the snake). In fact, I didn't draw the snake - why bother?

Last changed on 15. February 2021, 14:37

on 15. February 2021, 14:36 by henrypijames
Treasure Map Python and Krokpi *and* anti-knight? Seems like a seriously overloaded ruleset (but won't stop me from trying since I'm a sucker for snake sudoku).

Difficulty:3
Rating:N/A
Solved:8 times
Observed:9 times
ID:0005GB

Path puzzle

Enter solution

Solution code:

Login