The Knight’s Tour Problem – using Accessibility Heuristic)
You are required to do the following:
(1) Print out an empty chessboard at the beginning
(2) Display the Table of Accessibility Numbers at the beginning
(3) After each successful placement, show the status of the chessboard. That is, indicate the sequence of steps that was used to visit all the positions on the board. For each board position, display the step at which the position was visited (i.e. 1, 2, 3, …, 64).
Your program can stop after finding and displaying one valid sequence of moves.
[Hint : You might think of using different functions. For instance, we could use a different function for each of the following: compute the Table of Accessibility Numbers, print (display) the chessboard, check for valid placement, etc.]
You can represent the 8×8 chessboard with a two-dimensional array.
0 comments