Switch to: Citations

Add references

You must login to add references.
  1. The heuristic search under conditions of error.Larry R. Harris - 1974 - Artificial Intelligence 5 (3):217-234.
    Download  
     
    Export citation  
     
    Bookmark   12 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  
  • The development of a world class Othello program.Kai-Fu Lee & Sanjoy Mahajan - 1990 - Artificial Intelligence 43 (1):21-36.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Singular extensions.Thomas Anantharaman, Murray S. Campbell & Feng-Hsiung Hsu - 1990 - Artificial Intelligence 43 (1):99-109.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • A world-championship-level Othello program.Paul S. Rosenbloom - 1982 - Artificial Intelligence 19 (3):279-320.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
    Download  
     
    Export citation  
     
    Bookmark   5 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  
  • The last player theorem.Dana S. Nau - 1982 - Artificial Intelligence 18 (1):53-65.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • An investigation of the causes of pathology in games.Dana S. Nau - 1982 - Artificial Intelligence 19 (3):257-278.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Searching for an optimal path in a tree with random costs.Richard M. Karp & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):99-116.
    Download  
     
    Export citation  
     
    Bookmark   11 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  
    • 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-7674574dd6-8q2d6 uwo