Digits on an arrow sum to the circled digit. All other circles (without arrows) contain the number of cells that the Knight has visited in their neighborhood---that is, the cells that are orthogonally or diagonally adjacent to the circled cell, as well as itself.
Lösungscode: Column 9
am 24. Januar 2024, 07:02 Uhr von JeffWajes
Very cool puzzle! I saw the comment about the break-in being straightforward and didn't believe it at first, but it really was. I'm amazed that the knight loop worked so well and resulted in such clean logic.
am 15. Januar 2024, 01:18 Uhr von cristophermoore
clarified (I hope) the ruleset and the definition of neighborhood.
am 6. Januar 2024, 12:57 Uhr von ArmagedDan
I'm really proud that I solved that one! A surprisingly straightforward break-in, and the rest flows beautifully.