This problem exercises the basic concepts of gamle playing, using tic-tac-toe (noughts and crosses) as an example. We define X, as the number of rows, columns, or diagonals with exactly n X's and no 0's. Similarly, 0, is the number of rows, columns, or diagonals with just n 0's. The utility function assigns +1 to any position with Xg = 1 and -1 to any position with O₃ = 1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eva1 (s) = 3X₂ (s) +X_I (s) - (302 (s) +O_l (s)).

a. Approximately how many possible games of tic-tac-toe are there?

b. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one 0 on the board), taking symmetry into account.

c. Mark on your tree the evaluations of all the positions at depth 2.

d. Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move.

e. Circle the nodes at depth 2 that would not be evaluated if alpha-beta pruning were applied, assuming the nodes are generated in the optimal order for alpha-betapruning.