the computer would need to evaluate all of these moves to determine which would be the best the decision would be based on which move would allow it to win before its opponent the next figure shows the part of the game tree that is constructed while evaluating the placement of an in the upper-right square upon evaluating this portion of the treethe computer would soon learn it could win in two additional moves if its opponent placed their token in the uppermiddle square following the middle branch from the topthe computer would learn that if its opponent placed their token in the middle-right square insteadit could not win in two more moves but the opponent could win in three moves in this situation finallyit would be determined that the opponent could win in the next move by playing in the lower-left square if the computer made this play while that' badthis is only one possible move the computer could make it still has to evaluate the other possible moves to determine if one is better eventuallythe computer would determine that the best move would be to play in the lower-left square this would be based on the fact it could win on the next move by playing in either of two different places before its opponent could win using recursion to build game tree can make for very interesting games in which human competes against the computer we leave as an exercise the implementation of function to find the best move for the computer in playing tic-tac-toe applicationthe eight-queens problem in we explored the concept of backtracking and its use in solving certain problems such as that of finding path through maze in that problemwe saw that backtracking allows us to move forward searching for solution andwhen necessaryto back up one or more steps in order to try other options backtracking solutions require the use of stack in order to remember the current solution and to remove the latter parts of that solution when it' necessary to back up and try other options