Trace the execution of the recursive depth-first searchalgorithm (the version that does not use an open list) on the statespace of Figure 6.5.
Figure 6. 5 Legal moves of a chess knight. 2 move(1,8) move(1,6) move(2,9) move(2,7) move(3,4) move(3,8) move(4,9) move(4,3) move(6,1) move(6,7) move(7,2) move(7,6) move(8,3) move(8,1) move(9,2) move(9,4) 8 9 Figure 6.6 A3 x 3 chessboard with move rules for the simplified knight tour problem. Show transcribed image text Figure 6. 5 Legal moves of a chess knight. 2 move(1,8) move(1,6) move(2,9) move(2,7) move(3,4) move(3,8) move(4,9) move(4,3) move(6,1) move(6,7) move(7,2) move(7,6) move(8,3) move(8,1) move(9,2) move(9,4) 8 9 Figure 6.6 A3 x 3 chessboard with move rules for the simplified knight tour problem.
Expert Answer
Answer to Trace the execution of the recursive depth-first search algorithm (the version that does not use an open list) on the st…