The ABDADA Distributed Minimax 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 CM5 and a 128-node CRAY T3D computers are given. 1 INTRODUCTION In the search for power to run our game-playing programs as fast as possible, the use of parallel computers is a stimulating choice. During the past few years, parallel algorithms have evolved from fixed master-slave relationships, where the master looked for slaves to complete its task, to more dynamic master-slave relationships, where unemployed processors look for a master in order to find some task to do. But those master-slave relationships, which are exemplified by the work-stealing schedulers of Jamboree[12] and YBWC[7] still suffer from synchronization overheads. In this paper, we describe a non-synchronized parallel algorithm named ABDADA