A Taxonomy of Parallel Game-Tree Search Algorithms

Article type: Research Article

Authors: Brockington, M.G.^{; *}

Affiliations: Edmonton, Alberta, Canada

Note: [*] Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, T6G 2H1. E-mail: brock@cs.ualberta.ca.

Abstract: In the last twenty years, a number of articles and theses have been written that contain innovative parallel game-tree search algorithms. The authors of the parallel algorithms have shown how their work is unique and interesting. In some cases, this has been shown by classifying other algorithms by listing implementation details (Bal and Van Renesse, 1986; Ciancarini, 1994). To the author’s knowledge, no attempt has been made to classify the algorithms based solely on their algorithmic properties. A taxonomy would make it easy to ascertain what has and has not been accomplished in parallel game-tree search. The presentation of this type of taxonomy is the main contribution of this paper.

DOI: 10.3233/ICG-1996-19303

Journal: ICGA Journal, vol. 19, no. 3, pp. 162-174, 1996