Consider the game tree for a 2-player turn-taking minimax game shown in the figure. The value of the terminal node represent the utility of the game state if the game end there. There are two player Max \& Min. At any particular point state of the game Max prefers to move to a state of maximum value, on the other hand Min prefers to move to a state of min value. Suppose Max starts the game at the root and has three strategies 1, 2, 3. Next, Min plays and also has three strategies 1, 2, 3. The game end there. Both player always take optimal strategies throughout the game. At the root, the best strategy for max is ________ (int).
