A parallel alpha/beta tree searching algorithm

DOI10.1016/0167-8191(89)90102-6zbMATH Open0673.68043OpenAlexW2041232030MaRDI QIDQ1121027FDOQ1121027

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

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
• Parallel search in bivalued game trees

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)

Cited In (11)

• Parallel randomized best-first minimax search.
• Unsynchronized iteratively deepening parallel alpha-beta search
• On parallel evaluation of game trees
• Title not available (Why is that?)
• A game tree with distinct leaf values which is easy for the alpha-beta algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the scalability of parallel UCT
• Title not available (Why is that?)
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Title not available (Why is that?)

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)