Parallel search in bivalued game trees

DOI10.1016/0743-7315(91)90132-SMaRDI QIDQ809606zbMATH OpenFDO

Authors Klaus Zeppenfeld

Publication date 1991

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

parallel programminggame tree searchprobabilistic game tree model

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 4162692
• A parallel alpha/beta tree searching algorithm
• On parallel evaluation of game trees
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• Unsynchronized iteratively deepening parallel alpha-beta search

Cited in

(9)

• A Parallel Game Tree Search Algorithm With A Linear Speedup
• A parallel search game
• scientific article; zbMATH DE number 1760141 (Why is no real title available?)
• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
• 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.
• A parallel alpha/beta tree searching algorithm
• On parallel evaluation of game trees

This page was built for publication: Parallel search in bivalued game trees

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