Alpha-beta pruning is an approach to approximate the result of the min-max algorithm while reducing the computation necessary to do so. Though the acton selected by this algorithm may not be the optimal with respect to the min-max algorithm, we have the guarantee that it will the loss with respect the action is not bigger than a certain bound.

a. True
b. False