Knights Tour Problem

The puzzle - to try to move a Knight on a chess board, using its normal 2,1 moves so that each square is visited once only.

It is a closed tour the if last square is a knights move away from first square.

You select the size of board (5*5 or 6*6), the start position as row,col and one solution is found. If closed is ticked then the program keeps looking for such a solution. Note there is no closed solution if the board size is odd.

Press ShowMoves to see how it does it - using backtracking - where the moves are shown - note this takes a long time! Bigger boards take too long!!

Go Back