Switch to: References

Add citations

You must login to add citations.
  1. A Bayesian approach to relevance in game playing.Eric B. Baum & Warren D. Smith - 1997 - Artificial Intelligence 97 (1-2):195-242.
  • An incremental negamax algorithm.Ingo Althöfer - 1990 - Artificial Intelligence 43 (1):57-65.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Benefits of using multivalued functions for minimaxing.Anton Scheucher & Hermann Kaindl - 1998 - Artificial Intelligence 99 (2):187-208.
  • Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
  • When is it better not to look ahead?Dana S. Nau, Mitja Luštrek, Austin Parker, Ivan Bratko & Matjaž Gams - 2010 - Artificial Intelligence 174 (16-17):1323-1338.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The multi-player version of minimax displays game-tree pathology.David Mutchler - 1993 - Artificial Intelligence 64 (2):323-336.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Partial order bounding: A new approach to evaluation in game tree search.Martin Müller - 2001 - Artificial Intelligence 129 (1-2):279-311.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
  • Is real-valued minimax pathological?Mitja Luštrek, Matjaž Gams & Ivan Bratko - 2006 - Artificial Intelligence 170 (6-7):620-642.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Limited lookahead in imperfect-information games.Christian Kroer & Tuomas Sandholm - 2020 - Artificial Intelligence 283 (C):103218.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation