PUBLIC MARKS from bcpbcp with tags games.cs.ualberta.ca & damas

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.