Switch to: References

Add citations

You must login to add citations.
  1. An incremental negamax algorithm.Ingo Althöfer - 1990 - Artificial Intelligence 43 (1):57-65.
    Download  
     
    Export citation  
     
    Bookmark  
  • Limited lookahead in imperfect-information games.Christian Kroer & Tuomas Sandholm - 2020 - Artificial Intelligence 283 (C):103218.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Search in games with incomplete information: a case study using Bridge card play.Ian Frank & David Basin - 1998 - Artificial Intelligence 100 (1-2):87-123.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The multi-player version of minimax displays game-tree pathology.David Mutchler - 1993 - Artificial Intelligence 64 (2):323-336.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Pathology on game trees revisited, and an alternative to minimaxing.Dana S. Nau - 1983 - Artificial Intelligence 21 (1-2):221-244.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The effect of mobility on minimaxing of game trees with random leaf values.Mark Levene & Trevor I. Fenner - 2001 - Artificial Intelligence 130 (1):1-26.
    Download  
     
    Export citation  
     
    Bookmark  
  • Is real-valued minimax pathological?Mitja Luštrek, Matjaž Gams & Ivan Bratko - 2006 - Artificial Intelligence 170 (6-7):620-642.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Benefits of using multivalued functions for minimaxing.Anton Scheucher & Hermann Kaindl - 1998 - Artificial Intelligence 99 (2):187-208.
    Download  
     
    Export citation  
     
    Bookmark   3 citations