A parallel alpha/beta tree searching algorithm

DOI10.1016/0167-8191(89)90102-6MaRDI QIDQ1121027zbMATHOpenAlexFDO

Authors Robert M. Hyatt, Bruce W. Suter, Harry L. Nelson

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90102-6

zbMATH Keywords

searching algorithmssplittingalpha/beta algorithmprinciple variationPrinciple Variation Splitting (PVS)speedup by parallel processing

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Trees (05C05) Searching and sorting (68P10) Artificial intelligence (68T99)

Recommendations

• On parallel evaluation of game trees
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• Parallel randomized best-first minimax search.
• scientific article; zbMATH DE number 4162692
• Parallel search in bivalued game trees

Cited in

(11)

• scientific article; zbMATH DE number 2088035 (Why is no real title available?)
• A game tree with distinct leaf values which is easy for the alpha-beta algorithm
• scientific article; zbMATH DE number 1927212 (Why is no real title available?)
• scientific article; zbMATH DE number 4162692 (Why is no real title available?)
• scientific article; zbMATH DE number 4162263 (Why is no real title available?)
• Parallel randomized best-first minimax search.
• On the scalability of parallel UCT
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Unsynchronized iteratively deepening parallel alpha-beta search
• scientific article; zbMATH DE number 1759677 (Why is no real title available?)
• On parallel evaluation of game trees

This page was built for publication: A parallel alpha/beta tree searching algorithm

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