Change Log
(Published on 7. July 2025, 20:21 by juggler)
Normal 6x6 Sudoku rules apply.
- Draw a path along interior gridlines from the robot to the exit. The path cannot touch itself.
- The robot computes the difference between each pair of digits it passes between, and writes these differences to the grey memory cells in reading order. (All memory cells must be written to).
Solution code: Memory cells that don't touch the path (even diagonally)
Comments
on 12. August 2025, 17:55 by MikeMeech
Very cool concept and fun puzzle!
on 1. August 2025, 22:42 by Suxamethonium
Loved it! The logic itself was not too hard (but still very satisfying!). The difficulty came from trying to keep everything in my working memory. I had to keep going back to recount where I was in the path!
on 31. July 2025, 08:20 by XuanZzz
Super cute!
on 11. July 2025, 07:52 by Crusader175
Cool!
on 10. July 2025, 21:08 by softie
This completely taxed my working memory and I felt just about to crash, and then all of a sudden, it was solved!
on 10. July 2025, 13:24 by Exigus
Cool idea and nicely executed
on 10. July 2025, 08:51 by QuiltyAsCharged
Beep boop! Puzzle provides effective diversion!
on 9. July 2025, 02:14 by marty_sears
Beautiful! really loved this, felt very fresh and had some very nice moments in it. Agree that a 9x9 version seems like it could find a lot more very cool logic in this ruleset
on 8. July 2025, 11:52 by marcmees
very creative & refreshingly new. Thanks
on 8. July 2025, 07:45 by Cane_Puzzles
Beautiful idea and puzzle!
Would love to see a 9x9.
on 7. July 2025, 23:56 by eladv
Awesome puzzle!!!
clarification: the solution code is the contents of the memory cells that don't touch the path (even diagonally), IN READING ORDER
on 7. July 2025, 22:43 by zeniko
Nice puzzle, thanks for sharing.
What wasn‘t obvious to me from the rules was whether the robot had to fill all the memory cells or whether a shorter path (with arbitrary values in the memory cells) was allowed. Apparently the former was intended.
on 7. July 2025, 21:38 by Nylimb
Very interesting; thanks.
