Answer:
From the given diagram, consider a MIN node whose children are terminal nodes, if MIN plays
suboptimal. MIN will never be lower than the utility obtained playing against an optimal MIN
MIN will always select a move having minimax utility greater than or equal to the move that is
predicted by the minimax that is the MIN-played optimal value.
Then the MIN node's value is increased to MAX. This is done by induction.
One can do better than the minimax strategy, if the suboptimal play is predicted by MIN.
If MIN always falls for certain for certain kind of trap and losses, then setting up a trap guarantees a win.
Explanation:
See attached picture also.
