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  
  • Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Using knowledge to control tree searching.David E. Wilkins - 1982 - Artificial Intelligence 18 (1):1-51.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Using patterns and plans in chess.David Wilkins - 1980 - Artificial Intelligence 14 (2):165-203.
    Download  
     
    Export citation  
     
    Bookmark   7 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  
  • The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Using chunking to solve chess pawn endgames.Hans Berliner & Murray Campbell - 1984 - Artificial Intelligence 23 (1):97-120.
    Download  
     
    Export citation  
     
    Bookmark   2 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