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)

Full work available at URL https://doi.org/10.1016/0743-7315(91)90132-S

zbMATH Keywords

game tree searchparallel programmingprobabilistic game tree model

Mathematics Subject Classification ID

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

Review text

The author describes three parallel search strategies in bivalued game trees. Available processors are distributed statically by top down - and bottom up strategies and dynamically by a strategy which needs information at the inner nodes of the search tree to decide whether the processors should be distributed at one node. Empirical results verify that the third strategy is best and the top-down strategy is want.

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 alpha/beta tree searching algorithm
• Parallel randomized best-first minimax search.
• A Parallel Game Tree Search Algorithm With A Linear Speedup
• On parallel evaluation of game trees
• scientific article; zbMATH DE number 4162263 (Why is no real title available?)
• scientific article; zbMATH DE number 4162692 (Why is no real title available?)
• 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
• A parallel search game

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)