The ABDADA distributed minimax search algorithm

This paper presents a new method to parallelize the minimax tree search algorithm. This method is then compared to the "Young Brother Wait Concept" algorithm in an Othello program implementation and in a Chess program. Results of tests done on a 32-node CMS and a 128-node CRAY T3D computers are given.

[1]  Bruce W. Suter,et al.  A parallel alpha/beta tree searching algorithm , 1989, Parallel Comput..

[2]  Jonathan Schaeffer,et al.  Multiprocessor tree-search experiments , 1986 .

[3]  E. W. Felten,et al.  Chess on a hypercube , 1988, C3P.

[4]  Bradley C. Kuszmaul,et al.  The STARTECH Massively-Parallel Chess Program , 1995, J. Int. Comput. Games Assoc..

[5]  Oliver Vornberger,et al.  Distributed game tree search , 1990 .

[6]  T. Anthony Marsland,et al.  Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.

[7]  Fred Popowich,et al.  Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Alexander Reinefeld,et al.  An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..

[9]  Monty Newborn,et al.  Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Judea Pearl,et al.  Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..

[11]  Bradley C. Kuszmaul,et al.  Synchronized MIMD computing , 1994 .

[12]  Carl Ebeling,et al.  Pattern Knowledge and Search: The SUPREM Architecture , 1989, Artif. Intell..

[13]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[14]  Jonathan Schaeffer,et al.  Distributed Game-Tree Searching , 1989, J. Parallel Distributed Comput..

[15]  T. A. Marsland,et al.  A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..