[computer-go] Distributed Alpha-Beta Papers?

[Álvaro Begué]

On 8/25/07, Phil G <go at thinkedge.com> wrote:
>
> Can someone recommend a good paper on distributed alpha-beta searching? Not
> necessarily for Go; I'm just interested in reading up on the subject.
>
> Thanks,
>
> - Phil
>
Some of the most popular algorithms are YBWC (Young Brothers Wait
Concept) and DTS (Dynamic Tree Splitting). Another interesting
approach is APHID (I forgot what it stands for). Google is your
friend. There are reasonably good articles out there describing all
three.

I remember seen a lengthy article comparing different methods in the
ICGA journal, but I can't find it.


Álvaro.