The *-minimax search procedure for trees containing chance nodes

DOI10.1016/S0004-3702(83)80015-0zbMath0513.68077MaRDI QIDQ1050777

Bruce W. Ballard

Publication date: 1983

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

minimax treesgame trees with probability nodesleft-to-right depth- first algorithm

Mathematics Subject Classification ID

2-person games (91A05) Artificial intelligence (68T99)

Related Items

Abstraction and approximate decision-theoretic planning., From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future, The multi-player version of minimax displays game-tree pathology, Probabilistic opponent-model search, Special issue: Heuristic search and computer game playing, Contingent planning under uncertainty via stochastic satisfiability

Cites Work

• Unnamed Item
• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• On the branching factor of the alpha-beta pruning algorithm