(e) (4) Briefly discuss how one might modify minimax so that it can solve the really exciting game of suicide 2 2 tictactoe with passing, in which the first player to complete 2-in-a-row loses. Describe optimal play for this game. [Hint: which is bettera move that definitely loses or a move whose value is unknown?

6. (22 pts.) Game playing Consider the game of 2 x 2 tictactoe where each player has the additional option of passing (i.e., marking no square). Assume X goes first (a) (6) Draw the full game tree down to depth 2. You need not show nodes that are rotations or reflections of siblings already shown. (Your tree should have five leaves.) uoion is the n (b) (4) Suppose the evaluation function is the number of Xs minus the number of Os. Mark the values of all leaves and internal nodes (c) (4) Circle any node that would not be evaluated by alpha-beta during a left-to-right exploration of your tree. d (4) Suppose we wanted to solve the game to find the optimal move .e., no depth limit). Explain why alpha-beta with an appropriate move ordering would be much better than minimax