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={Judea Pearl},
  journal={Commun. ACM},
  year={1982},
  volume={25},
  pages={559-564}
}
  • J. Pearl
  • Published 1 August 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… 

Figures from this paper

A Minimax Algorithm Better than Alpha-Beta ?

A new formulation for Stockman’s SSS* algorithm is presented, solving all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm, and a framework that facilitates the construction of several best-first fixeddepth game-tree search algorithms is presented.

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2

Non-Depth-First Search against Independent Distributions on an AND-OR Tree

A randomized competitive algorithm for evaluating priced AND/OR trees

  • E. Laber
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2008

A pr 2 01 8 Independent Distributions on a Multi-Branching ANDOR Tree of Height 2

We investigate an AND-OR tree T and a probability distribution d on the truth assignments to the leaves. Tarsi (1983) showed that if d is an independent and identical distribution (IID) such that

The Eigen Distribution of an AND-OR Tree under Directional Algorithms

Consider a probability distribution d on the truth assignments to a perfect binary AND-OR tree. Liu and Tanaka (2007) extends the work of Saks and Wigderson (1986), and they characterize the

On parallel evaluation of game trees

These algorithms parallelize the "left-to-right" sequential algori thm for evaluating A N D ] O R trees and the a-fl pruning procedure for evaluating MIN/MAX trees, and it is shown that, on every instance of a uniform tree, these parallel algorithms achieve a linear speed-up over their corresponding sequential algorithms.

Best-First Fixed-Depth Minimax Algorithms

A new formulation for Stockman's SSS ∗ algorithm, based on Alpha-Beta, is presented, finally transforming it into a practical algorithm, and a framework that facilitates the construction of several best-first fixed-depth game-tree search algorithms, known and new is presented.
...

References

SHOWING 1-10 OF 17 REFERENCES

Analysis of the alpha-beta pruning algorithm

An analytical expression for the expected number of bottom positions examined in a game tree using alpha-beta pruning is derived, subject to the assumptions that the branching factor N and the depth D of the tree are arbitrary but fixed, and the bottom positions are a random permutation of (N sub D) unique values.

A Minimax Algorithm Better than Alpha-Beta?

Asymptotic Properties of Minimax Trees and Game-Searching Procedures

  • J. Pearl
  • Computer Science
    Artif. Intell.
  • 1980
It is shown that a game with WIN-LOSS terminals can be solved by examining, on the average, O [(d) h 2 ] terminal positions if positions if P 0 ≠ P∗ and O [(P∗ (1 − P ∗) ) h ] positionsif P 0 = P∷, the former performance being optimal for all search algorithms.

A Space-Efficient On-Line Method of Computing Quantile Estimates

  • J. Pearl
  • Computer Science, Mathematics
    J. Algorithms
  • 1981

An Analysis of Alpha-Beta Pruning

Experiments With Some Programs That Search Game Trees

The problem of efficiently searching large trees is discussed, and a new method called “dynamic ordering” is described, and the older minimax and Alpha-Beta procedures are described for comparison purposes.

Optimal Search on Some Game Trees

It is proved that the dlrecUonal algorithm for solving a game tree is optimal, in the sense of average run trine, for balanced trees (a family containing all uniform trees). This result implies that

Permutation enumeration: four new permutation algorithms

Performance tests which have counted execution of assignment statements, comparisons, arithmetic operations, and subscripted array references have shown superiority of the new algorithms compared to Boothroyd's Implementation of M.B. Well's algorithm and Ehrlich's implementation of the Johnson-Trotter algorithm.

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above