Inivisible Friends (v2)
(Eingestellt am 12. März 2024, 12:44 Uhr von Nurator)
This is a reupload of my first published puzzle. After a lot of gained experience in setting I had to update this puzzle to make it as enjoyable as possible. Its still pretty hard, but especially the end solve is really smooth now. Enjoy :)
Rules:Normal Sudoku rules apply.
Draw a path through some orthogonally connected cells, such that the path visits every box and never enters or exits the same box twice. Each time the path changes the box, the total number of cells it visits in that box is increased by 1, starting with 1 in the starting box.
A cell is called friendly when its digit is equal to its row, column, or box number. There are 27 friendly cells in the grid.
The path visits all friendly cells, enters no cages and crosses no squares.
Adjacent digits on the path differ by at least 3.
Solve online:Lösungscode: Enter the digits in the first column from top to bottom
Kommentare
am 31. März 2024, 15:20 Uhr von Nurator
Changed rules here to be equal to the actual puzzle
am 30. März 2024, 00:00 Uhr von QuiltyAsCharged
I love this puzzle and saw v2, so I decided to play it again. It's smooth! :)
It seems that this version no longer needs a rule about "final cell of the path is in the same relative position...". I didn't need that rule to solve it. It's still included in the rules here, but not in the linked puzzle.
Response: thanks for the kind words! And yes you are right, removed the wrong rule here :)
