Title :
The APHID parallel αβ search algorithm
Author :
Brockington, Mark G. ; Schaeffer, Jonathan
Author_Institution :
Dept. of Comput. Sci., Alberta Res. Council, Edmonton, Alta., Canada
Abstract :
The paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the approaches used in practice. Instead of parallelism based on the minimal search tree, APHID uses a truncated game-tree and all of the leaves of that tree are searched in parallel. APHID has been programmed as an easy to implement, game-independent αβ library, and has been tested on several game-playing programs. Results for an Othello program are presented. The algorithm yields good parallel performance on a network of workstations, without using a shared transposition table
Keywords :
computer games; games of skill; local area networks; parallel algorithms; parallel programming; tree searching; workstations; APHID game-tree search algorithm; APHID parallel αβ search algorithm; Asynchronous Parallel Hierarchical Iterative Deepening game-tree search algorithm; Othello program; game-independent αβ library; game-playing programs; parallel leaf searching; parallel performance; truncated game-tree; workstation network; Iterative algorithms; Libraries; Minimax techniques; Parallel algorithms; Parallel processing; Predictive models; Testing; Tree graphs; Workstations;
Conference_Titel :
Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on
Conference_Location :
New Orleans, LA
Print_ISBN :
0-8186-7683-3
DOI :
10.1109/SPDP.1996.570365
