Skip to main content
SpringerLink
Log in

Minimax Game Tree Searching

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Minimax Trees

Sequential Minimax Game Tree Algorithms

  Minimax Algorithm

  Alpha-Beta Algorithm

  SSS∗

  SCOUT: Minimax Algorithm of Theoretical Interest

  Generalized Game Tree Search Algorithm

  Recursive State Space Search Algorithm

  Some Variations On The Subject

Parallel Minimax Tree Algorithms

  A Simple Way to Parallelize the Exploration of Minimax Trees

  A Mandatory Work First Algorithm

  Aspiration Search

  Tree-Splitting Algorithm

  Principal Variation Splitting Algorithm

  Distributed State Space Search

  Distributed Game Tree Search Algorithm

  Parallel Minimax Algorithm with Linear Speedup

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akl SG, Barnard DT, Doran RJ (1979) Searching game trees in parallel. In: Proc. 3rd Biennial Conf. Canad. Soc. Computation Studies of Intelligence, pp 224–231

    Google Scholar 

  2. Akl SG, Barnard DT, Doran RJ (1982) Design, analysis, and implementation of a parallel tree search algorithm. IEEE Trans Pattern Anal Machine Intell PAMI-4(2):192–203

    Article  Google Scholar 

  3. Almquist K, McKenzie N, Sloan K (1988) An inquiry into parallel algorithms for searching game trees. Techn. Report Univ. Washington, Seattle, WA 12(3)

    Google Scholar 

  4. Althöfer I (1988) On the complexity of searching game trees and other recursion trees. J Algorithms 9:538–567

    Article  MathSciNet  MATH  Google Scholar 

  5. Althöfer I (1990) An incremental negamax algorithm. Artif Intell 43:57–65

    Article  MATH  Google Scholar 

  6. Ballard BW (1983) The ∗ -minimax search procedure for trees containing chance nodes. Artif Intell 21:327–350

    Article  MATH  Google Scholar 

  7. Baudet GM (1978) The design and analysis of algorithms for asynchronous multiprocessors. PhD Thesis Carnegie-Mellon Univ. Pittsburgh, PA, CMU-CS-78-116

    Google Scholar 

  8. Böhm M, Speckenmeyer E (1989) A dynamic processor tree for solving game trees in parallel. Proc. SOR'89

    Google Scholar 

  9. Cung V-D, Roucairol C (1991) Parallel minimax tree searching. Res Report INRIA, vol 1549

    Google Scholar 

  10. Diderich CG (1992) Evaluation des performances de l'algorithme SSS∗ avec phases de synchronisation sur une machine parallèle à mémoires distribuées. Techn. Report Computer Sci. Dept. Swiss Federal Inst. Techn. Lausanne, Switzerland, LiTH-99 (In French.)

    Google Scholar 

  11. Feigenbaum EA, Feldman J (1963) Computers and thought. McGraw-Hill, New York

    MATH  Google Scholar 

  12. Feldmann R, Monien B, Mysliwietz P, Vornberger O (1989) Distributed game tree search. ICCA J 12(2):65–73

    Google Scholar 

  13. Feldmann R, Mysliwietz P, Monien B (1994) Game tree search on a massively parallel system. In: van den Herik HJ, Herschberg IS, Uiterwijk JWHM (eds) Advances in Computer Chess, vol 7. Univ. Limburg, Maastricht, pp 203–218

    Google Scholar 

  14. Finkel RA, Fishburn JP (1982) Parallelism in alpha-beta search. Artif Intell 19:89–106

    Article  MathSciNet  MATH  Google Scholar 

  15. Hewett R, Krishnamurthy G (1992) Consistent linear speedup in parallel alpha-beta search. Proc. ICCI'92, Computing and Information. IEEE Computer Soc Press, New York, pp 237–240

    Google Scholar 

  16. Ibaraki T (1986) Generalization of alpha-beta and {SSS*} search procedures. Artif Intell 29:73–117

    Article  MathSciNet  MATH  Google Scholar 

  17. Karp RM, Zhang Y (1989) On parallel evaluation of game trees. In: ACM Annual Symp. Parallel Algorithms and Architectures (SPAA'89). ACM, New York, pp 409–420

    Chapter  Google Scholar 

  18. Knuth DE, Moore RW (1975) An analysis of alpha-beta pruning. Artif Intell, 6(4):293–326

    Article  MathSciNet  MATH  Google Scholar 

  19. Marsland TA, Campbell MS (1982) Parallel search of strongly ordered game trees. ACM Computing Surveys 14(4):533–551

    Article  Google Scholar 

  20. Marsland TA, Popowich F (1985) Parallel game-tree search. IEEE Trans Pattern Anal Machine Intell PAMI-7(4):442–452

    Article  Google Scholar 

  21. Marsland TA, Reinefeld A, Schaeffer J (1987) Low overhead alternatives to SSS∗. Artif Intell 31:185–199

    Article  Google Scholar 

  22. McAllester DA (1988) Conspiracy numbers for min-max searching. Artif Intell 35:287–310

    Article  MathSciNet  MATH  Google Scholar 

  23. Pearl J (1980) Asymptotical properties of minimax trees and game searching procedures. Artif Intell 14(2):113–138

    Article  MathSciNet  MATH  Google Scholar 

  24. Pijls W, de Bruin A (Aug. 1990) Another view of the SSS∗ algorithm. In: Proc. Internat. Symp. (SIGAL'90)

    Google Scholar 

  25. Rivest RL (1987) Game tree searching by min/max approximation. Artif Intell 34(1):77–96

    Article  MathSciNet  MATH  Google Scholar 

  26. Roizen I, Pearl J (1983) A minimax algorithm better than alpha-beta? Yes and no. Artif Intell 21:199–230

    Article  MathSciNet  MATH  Google Scholar 

  27. Slagle JH, Dixon JK (Apr. 1969) Experiments with some programs that search game trees. J ACM 16(2):189–207

    Article  MATH  Google Scholar 

  28. Steinberg IR, Solomon M (1990) Searching game trees in parallel. Proc. IEEE Internat. Conf. Parallel Processing, III, III–9–III–17

    Google Scholar 

  29. Stockman GC (1979) A minimax algorithm better than alpha-beta? Artif Intell 12(2):179–196

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sci. Department, Swiss Federal Institute Technology-Lausanne, Lausanne, Switzerland

    Claude G. Diderich

  2. Ecole Sup. d'Ingénieurs de Luminy, Université Méditerrannée, Marseille, France

    Marc Gengler

Authors
  1. Claude G. Diderich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Gengler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Diderich, C.G., Gengler, M. (2008). Minimax Game Tree Searching . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_370

Download citation

Publish with us

Policies and ethics

Search

Navigation