The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

@article{Pearl1982TheSF,
title={The solution for the branching factor of the alpha-beta pruning algorithm and its optimality},
author={J. Pearl},
journal={Commun. ACM},
year={1982},
volume={25},
pages={559-564}
}

M. Douglas Mcllroy* and Data Structures Editor stop(top). In such a situation, the element top has to be deleted from the stack and more operations are required to generate the next combination. When k > top > 2, one can show that the probability for a specific value of top that a[top] = stop(top) is a(top + l ) /a( top) , which reduces to (k top + l ) / (n top). Hence, when k is small compared to n, it is very unlikely that the next combination is generated by using the theoretical maxim u m… CONTINUE READING