Skip to main content
SpringerLink
Log in

Asymptotic complexity of game-searching procedures

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 88))

  • 146 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Knuth, D. E., and Moore, R. N. An analysis of alpha-beta pruning. Artificial Intelligence 6 (1975), 293–326.

    Google Scholar 

  2. Slagle, J. R., and Dixon, J. K. Experiments with some programs that search game trees. Journal of the ACM 2 (1969), 189–207.

    Google Scholar 

  3. Fuller, S. H., Gaschnig, J. G., and Gillogly, J. J. An analysis of the alphabeta purning algorithm. Department of Computer Science Report, Carnegie-Mellon University (1973).

    Google Scholar 

  4. Baudet, G. M. On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence 10 (1978), 173–199.

    Google Scholar 

  5. Pearl, J. An economical method of updating quantile estimates. UCLA-ENG-CSL-8018, University of California, Los Angeles (1980).

    Google Scholar 

  6. Stockman, G. A minimax algorithm better than alpha-beta? Artificial Intelligence 12 (1979), 179–196.

    Google Scholar 

  7. Pearl, J. Asymptotic properties of minimax trees and game-searching procedures. UCLA-ENG-CSL-7981, University of Los Angeles (1980). To appear in Artificial Intelligence.

    Google Scholar 

  8. Noe, T. A comparison of the alpha-beta and SCOUT algorithms using the game of Kalah. UCLA-ENG-CSL-8017, University of California, Los Angeles (1980).

    Google Scholar 

  9. Pearl, J. The solution for the branching factor of the alpha-beta pruning algorithm. UCLA-ENG-CSL-8019, University of California, Los Angeles (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cognitive Systems Laboratory School of Engineering and Applied Science, University of California, Los Angeles, 90024, Los Angeles, California, USA

    Judea Pearl

Authors
  1. Judea Pearl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pearl, J. (1980). Asymptotic complexity of game-searching procedures. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022526

Download citation

  • DOI: https://doi.org/10.1007/BFb0022526

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation