A quantitative analysis of the alpha-beta pruning algorithm

DOI10.1016/S0004-3702(83)80020-4zbMath0521.68038OpenAlexW2037591597MaRDI QIDQ1055189

Nevin M. Darwish

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)80020-4

zbMATH Keywords

efficiency of the alpha-beta pruning algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) 2-person games (91A05) Artificial intelligence (68T99)

Related Items (1)

A generalization of alpha-beta and \(SSS^*\) search procedures

Cites Work

• Unnamed Item
• Unnamed Item
• A minimax algorithm better than alpha-beta?
• 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
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program

This page was built for publication: A quantitative analysis of the alpha-beta pruning algorithm