Abstract
We present a distributed algorithm for searching game trees. Two new concepts are introduced in order to reduce search and communication overheads, viz. the Young-Brothers-Wait and the Helpful-Master concepts. 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.
Get full access to this article
View all access options for this article.