Sightseeing K(n)ights
(Published on 9. September 2020, 19:27 by RSP)
Knights are out and about, visiting places around the grid. Help them find their way!
Rules are as follows:
- Normal sudoku rules apply.
- For a digit n between 1 and 7 inclusive, there is a knight's tour comprised of digits n, of exactly length n.
- Digits of n (not 8, 9) which are not part of a knight's tour may not appear a knight's move (in chess) away from any other cell containing n. (anti-knight)
- Tours may not branch nor loop.
- The box where each n's tour starts and ends is given.
You can try it out on f-puzzles.com or penpa if you'd like.
I hope you enjoy!
Solution code: Column 1, Column 8
Comments
on 11. September 2020, 01:42 by Genomico
Very nice puzzle. Interesting solving path.
on 10. September 2020, 16:49 by bosjo
In my opinion, the tour "length" is actually n-1 — the number of digits in the sequence is n, so it has n-1 "moves". That explains why the "1" is missing in the diagram; it doesn't move!
on 10. September 2020, 14:33 by stefliew
A tour of length 1 is basically anti-knight since if a pair of 1's see each other by a knight's move, that would make it a tour of length 2.
on 10. September 2020, 12:11 by RSP
The 1's tour has length 1. There is no mistake in the given image.
on 10. September 2020, 10:51 by Semax
The box where the 1's tour starts and ends it not given (yet?). Is it because 1's don't make a tour, or for the 1's tour you don't want to give it, or you forgot to give it?
on 9. September 2020, 19:28 by RSP
If anyone would be willing to translate the rules to German, I would greatly appreciate your help! I'm afraid this rule set might be harder to understand than others.
