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

DOI10.1016/S0004-3702(83)80010-1MaRDI QIDQ1837546zbMATH OpenOpenAlexWikidataFDO

Authors Igor Roizen, Judea Pearl

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

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

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3312170 (Why is no real title available?)
• A comparison of minimax tree search algorithms
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• Asymptotic properties of minimax trees and game-searching procedures
• On the branching factor of the alpha-beta pruning algorithm
• The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

Cited in

(9)

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

This page was built for publication: A minimax algorithm better than alpha-beta? Yes and no

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837546)