The Distribution of the Knight

Dr Colin Rose
 

Solutions:   4 × m

For any given starting point, how many solutions exist to the Knight's Tour problem?
This page displays the answer for all (4 × m) chess boards, for m < 9.

4 × 3
2 4 2
0 0 0
0 0 0
2 4 2

Solutions: 16


4 × 4
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

Solutions: 0


4 × 5
32 7 4 7 32
0 0 0 0 0
0 0 0 0 0
32 7 4 7 32

Solutions: 164


4 × 6
220 116 36 36 116 220
0 0 0 0 0 0
0 0 0 0 0 0
220 116 36 36 116 220

Solutions: 1488


4 × 7
1682 581 526 800 526 581 1682
0 0 0 0 0 0 0
0 0 0 0 0 0 0
1682 581 526 800 526 581 1682

Solutions: 12756


4 × 8
7630 2740 2066 3108 3108 2066 2740 7630
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
7630 2740 2066 3108 3108 2066 2740 7630

Solutions: 62176