Load Balancing in a Parallel Chess Program

摘要

Chess is a good problem for testing parallel computational applications, due to the complexity of the task of evenly dividing the work of searching chess game trees. In this paper, a parallel program written to play chess is described, along with various attempts at improving its speed through the use of different load-balancing strategies. The results show that different strategies work best at different search-tree depths.