Alpha and Beta values
At a M?x node we will store an alpha value
- the alpha value is lower bound on the exact minimax score
- the true value might be ? ?
- if we know Min can choose moves with score < ?
- then Min will never choose to let Max go to a node where the score will be ? or more
At a Min node, we will store a beta value
- the beta value is upper bound on the exact minimax score
- the true value might be ? ?
Alpha-Beta search uses these values to cut search