The paper investigates the efficiency of parallel minimax algorithms for search in a game tree. The game used as a case study is a tic-tac-toe. The suggested parallel computational model exploits tree partitioning at width for each level of the game tree and is based on combination of the parallel algorithmic paradigms "manager-workers" and "asynchronous iterations". Performance comparison has been made for hybrid (multilevel,) flat and multithreaded parallel programming models. Speedup and efficiency as well as scalability in respect to the size of the multicomputer and its impact on the performance of the parallel system have been estimated on the basis of experimental results. The communication/computation ratio (CCR) of the parallel hybrid and flat implementations of the minimax algorithm has been estimated.
[1]
David Eppstein,et al.
Parallel Algorithmic Techniques for Combinatorial Computation
,
1988,
ICALP.
[2]
Cameron Browne,et al.
Connection Games - Variations on a Theme
,
2005
.
[3]
Fred Popowich,et al.
Parallel Game-Tree Search
,
1985,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4]
Jonathan Schaeffer,et al.
APHID: Asynchronous Parallel Game-Tree Search
,
2000,
J. Parallel Distributed Comput..
[5]
Mark G. Brockington,et al.
A Taxonomy of Parallel Game-Tree Search Algorithms
,
1996,
J. Int. Comput. Games Assoc..
[6]
Ying Tan,et al.
Performance Analysis of Two Parallel Game-Tree Search Applications
,
2006,
PARA.