Anti-Knight Knight's Tour Sudoku
Normal Sudoku rules apply. Also, no digit can be a knight's move away from any identical digit.
A 17-cell "knight's tour" runs through the grid, which begins in one corner (R1C1, R1C9, R9C1 or R9C9) with the digit 1, steps incrementally by knight's move through 2,3,4...9 and then descends through 8,7,6,5... to 1, without re-visiting any cells nor visiting any of the givens. Also, the knight's tour must visit at least 8 of the 9 3x3 boxes of the grid.
I recommend coloring the givens before beginning the solve, to remember that they cannot be used by the tour.
Solution code: The digits of the column in which the knight's tour first encounters a 7; then the digits of the row in which the tour last encounters a 3. Remember that the start of the tour is in a corner cell. (18 digits total)
on 22. April 2023, 00:46 by juddimal
Great puzzle. No, really, color in the givens as recommended; it will keep you from making bad decisions later.
on 14. September 2021, 16:52 by glum_hippo
added online solving tool tag
on 19. October 2020, 10:52 by Lisztes
Nice puzzle :) (found my error)