Consider a minimax tree for an adversarial search problem. For example, in this picture (alpha-beta pruning):When marking the the tree with $[\min,\max]$ values bottom-up, we first traverse node $3$ and assign $B.\max = 3$. Then we traverse $12$ and $8$ in this order, it will make sure $B.max = 3$.But why is $B.\min = 3$? What is the use of that value?
What use are the minimum values on minimax trees?
data structures;trees;game theory