Abstract
We present a distributed algorithm for searching game trees. A general strategy for distributed computing is used that can be applied also to other search algorithms. Two new concepts are introduced in order to reduce search overhead and communication overhead: the “Young Brothers Wait Concept” and the “Helpful Master Concept”. We describe some properties of our distributed algorithm including optimal speedup on best ordered game trees.
An implementation of this algorithm in a distributed chess program is studied and experimental data showing surprisingly good performance are presented. Since the performance of our algorithm increases with a better move ordering, this algorithm promises to outperform other known algorithms, especially when combined with state-of-the-art chess programs.
This work was partly supported by the German Research Association (DFG)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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, pp 231–234, 1980.
G.M. Baudet. On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence, (10):pp 173–199, 1978.
I. Bratko and D. Kopec. A test for comparison of human and computer performance in chess. Advances in Computer Chess 3 (M.R.B. Clarke ed.) Pergamon Press, 31–56, 1982.
M.S. Campbell and T.A. Marsland. A comparison of minmax tree search algorithms. Artificial Intelligence, (20):pp 347–367, 1983.
R.A. Finkel and J.P. Fishburn. Parallel alpha-beta search on arachne. IEEE International Conference on Parallel Processing, pp 235–243, 1980.
Ch. Ferguson and R.E. Korf. Distributed tree search and its application to branch and bound. Elsewhere in this volume, 1989.
R. Feldmann and P. Mysliwietz. Parallele Spielbaumsuche. Master’s thesis, University of Paderborn, West Germany, January 1988.
R. Feldmann, P. Mysliwietz, and O. Vornberger. A Local Area Network Used as a Parallel Architecture. Technical Report, University of Paderborn, West Germany, 1986.
Matthew M. Huntbach and F. Warren Burton. Alpha - beta search on virtual tree machines. Information Sciences, 44:pp 3–17, 1988.
V. Kumar and L.N. Kanal. A general branch and bound formulation for understanding and synthesizing and/or tree search procedures. Artificial Intelligence, (21):pp 179–197, 1983.
V. Kumar and L.N. Kanal. Parallel branch and bound formulations for and/or tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):pp 768–778, 1984.
D.E. Knuth and R.W. Moore. An analysis of alpha - beta pruning. Artificial Intelligence, (6):pp 293–326, 1975.
E.L. Lawler and D.E. Wood. Branch and bound methods: a survey. Operations Research, (14):pp 699–719, 1966.
T.A. Marsland and M.S. Campbell. Parallel search of strongly ordered game trees.Computing Surveys, 14(4):pp 533–551, 1982.
T.A. Marsland and F. Popowich. Parallel game tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(4):pp 442–452,1985.
B. Monien and O. Vornberger. Parallel processing of combinatorial search trees. Proceedings International Workshop on Parallel Algorithms and Architectures, Math. Research Nr. 38, Akademie - Verlag Berlin, pp 60–69, 1987.
M. Newborn. A parallel search chess program. ACM Annual Conference 1985, pp 272–277, 1985.
S.W. Otto and E.W. Feiten.Chess on a Hypercube. Technical Report, California Institute of Technology, USA, 1988.
J. Pearl. Assymptotic properties of minmax trees and game searching procedures. Artificial Intelligence, (14):pp 113–139, 1980.
F. Popowich and T.A. Marsland. Experiences With a Parallel Chess Program. Technical Report, Department of Computer Science, University of Alberta, Canada, 1983.
I. Roizen and J. Pearl. A minmax algorithm better than Alpha-Beta ? yes and no. Artificial Intelligence, (21):pp 199–219, 1983.
G. Schruefer. Minimax-Suchen Kosten, Qualitaet und Algorithmen. PhD thesis, University of Braunschweig, West Germany, 1988.
G.C. Stockman. A minmax algorithm better than alpha-beta ? Artificial Intelligence, (12):pp 179–196, 1979.
O. Vornberger and B. Monien. Parallel alpha-beta versus parallel sss*. Proceedings IFIP Conference on Distributed Processing, Distributed Processing, North Holland, pp 613–625, 1987.
O. Vornberger. Implementing branch and bound in a ring of processors. Proceedings of CONPAR 86,, Lecture Notes in Computer Science 237, Springer Verlag, pp 157–164, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Feldmann, R., Monien, B., Mysliwietz, P., Vornberger, O. (1990). Distributed Game Tree Search. In: Kumar, V., Gopalakrishnan, P.S., Kanal, L.N. (eds) Parallel Algorithms for Machine Intelligence and Vision. Symbolic Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3390-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3390-9_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7994-5
Online ISBN: 978-1-4612-3390-9
eBook Packages: Springer Book Archive