Switch to: References

Add citations

You must login to add citations.
  1. Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Time-efficient state space search.Alexander Reinefeld & Peter Ridinger - 1994 - Artificial Intelligence 71 (2):397-408.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Best-first fixed-depth minimax algorithms.Aske Plaat, Jonathan Schaeffer, Wim Pijls & Arie de Bruin - 1996 - Artificial Intelligence 87 (1-2):255-293.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Low overhead alternatives to SSS∗.T. A. Marsland, Alexander Reinefeld & Jonathan Schaeffer - 1987 - Artificial Intelligence 31 (2):185-199.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Generalization of alpha-beta and SSS∗ search procedures.T. Ibaraki - 1986 - Artificial Intelligence 29 (1):73-117.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A game tree with distinct leaf values which is easy for the alpha-beta algorithm.Ingo Althöfer & Bernhard Balkenhol - 1991 - Artificial Intelligence 52 (2):183-190.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•