Step 1: Understand the tree structure.
MAX moves first at the root with three choices, labelled strategies 1, 2 and 3, each leading to a MIN node. Each MIN node then has three choices, also labelled 1, 2 and 3, each leading to a terminal (leaf) node with a fixed utility value.
Step 2: Evaluate the MIN node reached by MAX's strategy 1.
Its children have values 8, 6, -1 (for MIN's strategies 1, 2, 3). MIN always picks the move with the minimum value, so this node's value is \(\min(8, 6, -1) = -1\).
Step 3: Evaluate the MIN node reached by MAX's strategy 2.
Its children have values 1, 5, 7. MIN picks the minimum: \(\min(1, 5, 7) = 1\).
Step 4: Evaluate the MIN node reached by MAX's strategy 3.
Its children have values -4, -3, -12. MIN picks the minimum: \(\min(-4, -3, -12) = -12\).
Step 5: Back up the values to the root and let MAX choose.
The root now sees three backed-up values: -1 (from strategy 1), 1 (from strategy 2), and -12 (from strategy 3). MAX always picks the move with the maximum value: \(\max(-1, 1, -12) = 1\), which is reached through strategy 2.
Final Answer:
The best strategy for MAX at the root is strategy 2, which guarantees a game value of 1.
\[ \boxed{2} \]