10. Recall that in Chapter 2 we posed the Knight’s Tour problem, in which a chess Knight is to visit each of the n × n squares on a chessboard. The challenge is to start on a given source square on a full 8 × 8 chess board (say (1,1)), and to find a sequence of moves that visits every square on the board once and only once, returning to the source square on that last move.

a. Starting on the (1,1) square try to solve the Knight’s Tour Problem (hint: you will perhaps find that this version of the problem requires excessive memory and so you might find it useful to identify a heuristic that will help guide the search. (See

b. below.)

b. Try to identify a heuristic that will help guide the first-time Knight’s Tour Solver to a correct solution.