A quantitative analysis of the alpha-beta pruning algorithm

DOI10.1016/S0004-3702(83)80020-4MaRDI QIDQ1055189zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program
• scientific article; zbMATH DE number 3177815 (Why is no real title available?)
• scientific article; zbMATH DE number 3723845 (Why is no real title available?)
• On the branching factor of the alpha-beta pruning algorithm
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores

Cited in

(1)

• A generalization of alpha-beta and SSS^* search procedures

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

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