Seven Traveling Knights
(Published on 13. February 2021, 11:10 by andreasv)
This is partly an anti-anti-knight puzzle.
Each given digit is the start or end of a path of chess knight's moves. It contains five or six digits, which are all the same as the given digit at the start/end. There are only seven such paths. See example with such a path for ones.
The sum of digits in cages is the same for all cages.
Normal Sudoku rules apply.
Try it at F-Puzzles.
Solution code: Digits from first row.
Solved by Thomster, Fedo , bigger, kalumtum, wjdrumm, loscpi, TonyN, jorgenunez, brandon_bot, ManuH, Henry Greene, Nothere, Aaronomys, achim-t, NikolaZ, samuella, pippilotta, Ryx, Diogoo21, geronimo92, Maggicrowd, saskia-daniela, Arka Badarka, Marijana, Raistlen, zorant, cdwg2000, Julianl, _bathory, ParaNox, Crul, AsierGG, Torvelo, zrbakhtiar, Sileem, Kekes
Comments
Last changed on 15. February 2021, 18:17
on 14. February 2021, 22:01 by Ryx
Tricky puzzle, for me. Thanks, I love a good challenge, when I can eventually solve it.
on 13. February 2021, 20:33 by TonyN
Thank-you, I enjoyed this!
