On the branching factor of the alpha-beta pruning algorithm

DOI10.1016/S0004-3702(78)80011-3zbMath0377.68023OpenAlexW2042231724MaRDI QIDQ1246268

Gerard M. Baudet

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(78)80011-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

A generalization of alpha-beta and \(SSS^*\) search procedures, Asymptotic properties of level-regular decision trees with randomly evaluated leaves, Statistical heuristic search, A minimax algorithm better than alpha-beta?, Bounded branching process and and/or tree evaluation, Asymptotic properties of minimax trees and game-searching procedures, The last player theorem, An investigation of the causes of pathology in games, Equilibrium points of an AND-OR tree: under constraints on probability, Is SSS* better than alpha-beta?, A minimax algorithm better than alpha-beta? Yes and no, Pathology on game trees revisited, and an alternative to minimaxing, A comparison of minimax tree search algorithms, On the nature of pathology in game searching, The *-minimax search procedure for trees containing chance nodes, A quantitative analysis of the alpha-beta pruning algorithm

Cites Work

• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• The technology chess program
• Experiments With Some Programs That Search Game Trees