04 March 2006 13:15
![](https://blogmarks.net/screenshots/2006/03/04/dead68557a0f89170603b237e75ed41e.png)
APHID Parallel Game-Tree Search Library
![](https://blogmarks.net/img/default-gravatar.gif)
APHID is an acronym for Asycnhronous Parallel Hierarchical Iterative Deepening. The APHID game-tree search algorithm attempts to accomplish many goals:
* to test out the viability of asynchronous search methods for parallel alpha-beta based search.
* to develop an algorithm that works well across all hardware platforms and applications.
* to implement a tool that can be easily inserted into legacy sequential search algorithms.
1
(1 marks)