Hi,
I'm wondering if the closed knight's tour below is solveable. The 8 x 8 board set up as follows:63g 62 61 60d 59 58 57 56 55 54e 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36h 35 34L 33 32k 31i 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11f 10 9a 8 7c 6 5 4 3b 2 1 0j
The letters are added to indicate the checkpoints. You start at square 56 and must reach the checkpoints as follows:
9a -> after 3 moves (excluding the preset move of at 56) 3b -> after 4 moves 7c -> after 8 moves 60d -> after 12 moves 54e -> after 13 moves 11f -> after 23 moves 63g -> after 31 moves 36h -> after 33 moves 31i -> after 35 moves 0j -> after 39 moves 32k -> after 43 moves 34L -> after 53 moves
I'm curious to learn how to solve it, and whether or not writing a program to seek the solution is a must.
I look forward to suggestions or code to solve the puzzle.
Many thanks for reading :)In reply to Find solution to knight's tour by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |