Distributed game tree search on a massively parallel system-Reference-Cited by-同舟云学术

Distributed game tree search on a massively parallel system

Published:1992 Issue: Volume: Page:270-288
ISSN:0302-9743
Container-title:Data structures and efficient algorithms
language:
Short-container-title:

Author:

Feldmann R.,Mysliwietz P.,Monien B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55488-2_32.pdf

Reference24 articles.

1. S.G. Akl, D.T. Barnard, and R.J. Doran. Simulation and analysis in deriving time and storage requirements for a parallel alpha-beta pruning algorithm. IEEE International Conference on Parallel Processing, pages 231–234, 1980.

2. G.M. Baudet. On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence, (10):pp 173–199, 1978.

3. I. Bratko and D. Kopec. A Test for Comparison of Human and Computer Performance in Chess, in Advances in Computer Chess 3, M.R.B. Clarke (editor), pages 31–56. Pergamon Press, 1982.

4. M.S. Campbell and T.A. Marsland. A comparison of minmax tree search algorithms. Artificial Intelligence, (20):pp 347–367, 1983.

5. N.G. deBruijn. A combinatorial problem. Indagationes Math., 8:pp 461–467, 1946.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ADABA: improving the balancing between runtime and accuracy in a new distributed version of the alpha–beta algorithm;Artificial Intelligence Review;2022-09-26

2. ADABA: An Algorithm to Improve the Parallel Search in Competitive Agents;Advances in Intelligent Systems and Computing;2019-04-12

3. Partitioning Methods to Parallelize Constraint Programming Solver Using the Parallel Framework Bobpp;Advanced Computational Methods for Knowledge Engineering;2013

4. Parallel Monte-Carlo Tree Search for HPC Systems;Euro-Par 2011 Parallel Processing;2011

5. Tree search and quantum computation;Quantum Information Processing;2010-11-21