Switch to: Citations

Add references

You must login to add references.
  1. Low overhead alternatives to SSS∗.T. A. Marsland, Alexander Reinefeld & Jonathan Schaeffer - 1987 - Artificial Intelligence 31 (2):185-199.
    Download  
     
    Export citation  
     
    Bookmark   5 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  
  • Conspiracy numbers.Jonathan Schaeffer - 1990 - Artificial Intelligence 43 (1):67-84.
    Download  
     
    Export citation  
     
    Bookmark   7 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  
  • 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 generalised quiescence search algorithm.Don F. Beal - 1990 - Artificial Intelligence 43 (1):85-98.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Measuring the performance potential of chess programs.Hans J. Berliner, Gordon Goetsch, Murray S. Campbell & Carl Ebeling - 1990 - Artificial Intelligence 43 (1):7-20.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
    Download  
     
    Export citation  
     
    Bookmark   5 citations