APHID: Asynchronous Parallel Game-Tree Search
- Mark Brockington
- Jonathan Schaeffer, Department of Computing Science, University of Alberta
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 the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented. APHID is implemented as a freely-available portable library, making the algorithm easy
Citation
M. Brockington, J. Schaeffer. "APHID: Asynchronous Parallel Game-Tree Search". Journal of Parallel and Distributed Computing, 60, pp 247-273, June 2000.| Keywords: | |
| Category: | In Journal |
BibTeX
@article{Brockington+Schaeffer:JournalofParallelandDistributedComputing00,
author = {Mark Brockington and Jonathan Schaeffer},
title = {APHID: Asynchronous Parallel Game-Tree Search},
Volume = "60",
Pages = {247-273},
journal = {Journal of Parallel and Distributed Computing},
year = 2000,
}Last Updated: June 05, 2007Submitted by Staurt H. Johnson
