Switch to: Citations

Add references

You must login to add references.
  1. A quantitative analysis of the alpha-beta pruning algorithm.Nevin M. Darwish - 1983 - Artificial Intelligence 21 (4):405-433.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A minimax algorithm better than alpha-beta? Yes and No.Igor Roizen & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):199-220.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • The technology chess program.James J. Gillogly - 1972 - Artificial Intelligence 3 (C):145-163.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A comparison of minimax tree search algorithms.Murray S. Campbell & T. A. Marsland - 1983 - Artificial Intelligence 20 (4):347-367.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A world-championship-level Othello program.Paul S. Rosenbloom - 1982 - Artificial Intelligence 19 (3):279-320.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the branching factor of the alpha-beta pruning algorithm.Gérard M. Baudet - 1978 - Artificial Intelligence 10 (2):173-199.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • An admissible and optimal algorithm for searching AND/OR graphs.C. L. Chang & J. R. Slagle - 1971 - Artificial Intelligence 2 (2):117-128.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores.M. M. Newborn - 1977 - Artificial Intelligence 8 (2):137-153.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A general branch and bound formulation for understanding and synthesizing and/or tree search procedures.Vipin Kumar & Laveen N. Kanal - 1983 - Artificial Intelligence 21 (1-2):179-198.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6b65f85844-t9k8j uwo