Return to MAIN (index) page Return to main THINKING GAMES page Knight moves    

Starting at any square on a normal chessboard, can you make �knight moves� so that you visit every square on the board once and only once? 

 A knight moves two squares (up, down, left, or right) then turns a 90-degree corner and moves one more square.  All the possible knight moves are shown in the diagram on the left.
1 2 3 4 5 6 7 8
9 10 11 12 13 14 15 16
17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32
33 34 35 36 37 38 39 40
41 42 43 44 45 46 47 48
49 50 51 52 53 54 55 56
57 58 59 60 61 62 63 64
   

Click here to see one solution

 

This puzzle is just one of many to be found in the

Maths extension resources