A minimax algorithm better than alpha-beta? Yes and no

DOI10.1016/S0004-3702(83)80010-1zbMath0507.68063OpenAlexW1971037297WikidataQ29544250 ScholiaQ29544250MaRDI QIDQ1837546

Judea Pearl, Igor Roizen

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(83)80010-1

zbMATH Keywords

game-tree searchingprobabilistic analysis of the performance of the game-searching SSS* algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Artificial intelligence (68T99) Decision theory for games (91A35)

Related Items

A generalization of alpha-beta and \(SSS^*\) search procedures, Game tree searching by min/max approximation, Asymptotic properties of level-regular decision trees with randomly evaluated leaves, Conspiracy numbers for min-max search, Best-first fixed-depth minimax algorithms, A game tree with distinct leaf values which is easy for the alpha-beta algorithm, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, Game tree algorithms and solution trees

Cites Work

• Unnamed Item
• Unnamed Item
• A minimax algorithm better than alpha-beta?
• Asymptotic properties of minimax trees and game-searching procedures
• An analysis of alpha-beta pruning
• On the branching factor of the alpha-beta pruning algorithm
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• A comparison of minimax tree search algorithms
• The solution for the branching factor of the alpha-beta pruning algorithm and its optimality