The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores

@article{Newborn1977TheEO,
  title={The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores},
  author={Monty Newborn},
  journal={Artif. Intell.},
  year={1977},
  volume={8},
  pages={137-153}
}
An analysis of the efficiency of the alpha-beto algorithm is carried out based on a probabilistic model in which terminal node scores depend on random branch values. Explicit expressions are derived for the expected number of terminal nodes scored for the cases of uniform trees of fanout N and cfdepths 2 and 3. For trees of depth 2, the expected number is oforder O(NHN); for trees of depth 3, the expected number is of order O(N2). An upper bound on the expected number of terminal nodes scored… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

An analysis of the alpha-beta algorithm for trees of depth two: P~partment of Computer Science Report, Technion-Israel Institute of Technology, 1=c~nnic~3 ~e1~ort :no

  • M. M. Newborn, A. Ziv, M. Neumann
  • 1975

An analysis of the alpha-beta pruning

  • I. Fuller, S. rI, J. G. Gasctmig, J. J. Gillogly
  • 1973

An analysis of the alpha - beta algorithm for trees of depth two : P ~ partment of Computer Science Report

  • M. M. Newborn, A. Ziv, M. Neumann

Similar Papers

Loading similar papers…