An analysis of the full alpha-beta pruning algorithm

DOI10.1145/800133.804359MaRDI QIDQ5402570zbMATH OpenOpenAlexFDO

Authors Gerard M. Baudet

Publication date 14 March 2014

Published in Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800133.804359

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40) 2-person games (91A05) Multistage and repeated games (91A20) Other game-theoretic models (91A40)

Recommendations

• Multi-player alpha-beta pruning
• Multi-cut -pruning in game-tree search
• scientific article; zbMATH DE number 1944388
• Publication:3489505
• Probability-based game tree pruning

Cited in

(5)

• Multi-player alpha-beta pruning
• scientific article; zbMATH DE number 1696767 (Why is no real title available?)
• scientific article; zbMATH DE number 1927212 (Why is no real title available?)
• Extended Null-Move Reductions
• scientific article; zbMATH DE number 1944388 (Why is no real title available?)

This page was built for publication: An analysis of the full alpha-beta pruning algorithm

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