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}
}
  • J. Pearl
  • Published 1982
  • Computer Science
  • Commun. ACM
  • 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
    112 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    A Minimax Algorithm Better Than Alpha-Beta? Yes and No
    • 59
    A Minimax Algorithm Better than Alpha-Beta ?
    Generalization of Alpha-Beta and SSS Search Procedures
    • T. Ibaraki
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1986
    • 45
    Equilibrium points of an AND-OR tree: Under constraints on probability
    • 11
    • Highly Influenced
    • PDF
    Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
    Non-Depth-First Search against Independent Distributions on an AND-OR Tree
    • T. Suzuki
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 2018
    • 3
    • PDF
    A randomized competitive algorithm for evaluating priced AND/OR trees
    • E. Laber
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2008
    • 7
    • PDF