Development and Tuning of Irregular Divide-and-Conquer Applications in DAMPVM/DAC
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Parallel minimax tree searching on GPU
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Optimistic selection rule better than majority voting system
CG'10 Proceedings of the 7th international conference on Computers and games
| Hi-index | 0.00 |
This 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 alpha-beta library, and has been tested on several game-playing programs. Results for an Othello program are presented here. The algorithm yields good parallel performance on a network of workstations, without using a shared transposition table.