APHID: Asynchronous Parallel Game-Tree S
โ
Mark G. Brockington; Jonathan Schaeffer
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 488 KB
Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining t