On parallel evaluation of game trees

DOI10.1145/293347.293353MaRDI QIDQ3158529zbMATH OpenOpenAlexFDO

Authors Richard Karp, Yanjun Zhang

Publication date 25 January 2005

Published in Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• A parallel alpha/beta tree searching algorithm
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• scientific article; zbMATH DE number 4162309
• scientific article; zbMATH DE number 4162692
• Parallel search in bivalued game trees

Cited in

(15)

• A parallel alpha/beta tree searching algorithm
• A parallel algorithm for solving the 'Hip` games
• A game tree with distinct leaf values which is easy for the alpha-beta algorithm
• Parallel randomized best-first minimax search.
• APHID: Asynchronous parallel game-tree search
• On the scalability of parallel UCT
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• scientific article; zbMATH DE number 4162263 (Why is no real title available?)
• scientific article; zbMATH DE number 4162692 (Why is no real title available?)
• Unsynchronized iteratively deepening parallel alpha-beta search
• scientific article; zbMATH DE number 1057778 (Why is no real title available?)
• scientific article; zbMATH DE number 895355 (Why is no real title available?)
• A parallel search game
• Asynchronous Games over Tree Architectures
• Parallel search in bivalued game trees

This page was built for publication: On parallel evaluation of game trees

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