A Parallel Game Tree Search Algorithm With A Linear Speedup
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4162692
- scientific article; zbMATH DE number 4162263
- Parallel search in bivalued game trees
- On parallel evaluation of game trees
- Efficient parallel strategy improvement for parity games
- New bounds on time and number of processors for multiprocessor optimal schedules
- scientific article; zbMATH DE number 862682
- Scalability and parallelization of Monte-Carlo tree search
Cited in
(16)- 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.
- Bits and pieces: Constructing chess endgame databases on parallel and vector architectures
- Parallel information algorithm with local tuning for solving multidimensional GO problems
- APHID: Asynchronous parallel game-tree search
- scientific article; zbMATH DE number 1629829 (Why is no real title available?)
- Scalability and parallelization of Monte-Carlo tree search
- On parallel evaluation of game trees
- scientific article; zbMATH DE number 4162692 (Why is no real title available?)
- scientific article; zbMATH DE number 5642148 (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 862682 (Why is no real title available?)
- Parallel search in bivalued game trees
This page was built for publication: A Parallel Game Tree Search Algorithm With A Linear Speedup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141528)
