recursion cannot visualize or evaluate this amount of information and instead must rely on experience in attempting to make the best moves consider the game of tic-tac-toe in which two players use board containing nine squares organized into three rows of three columnsthe two players take turns placing tokens of xs and os in the squares one player is assigned the xs while the other is assigned the os play continues until all of the squares are filledresulting in drawor one of the players wins by aligning three identical pieces verticallydiagonallyor horizontally the following diagrams show three different game boardstwo resulting in wins and one resulting in drawo suppose you are playing game of tic-tac-toe in which four moves have been played as followso and now it' ' turn to playwhich happens to be the computer the computer needs to evaluate all of its possible moves to determine the best move to makewhich it can do by evaluating the game tree starting from this point in the game it can use recursion and build recursive call tree to represent all possible moves in the game for both itself and its opponent during the recursionthe tokens are placed on the board for both the computer and its opponent as if they were both actually playing as the recursion unwindsthe tokens are picked to return the game to its current state this game tree shows the five possible moves the computer can make at this pointo