The Dynamic Tree-Splitting Parallel Search Algorithm
Robert M. Hyatt · ICGA Journal · 1997
This paper describes a High-performance parallel tree-search algorithm that uses Dynamic Tree Splitting (DTS) for searching αβ minimax game trees. The Algorithm Divides the search tree among several processors on a shared-memory parallel machine. The paper deals with the following topics: (1) the D TS algorithm, (2) analyzing αβ to select split points, (3) performance results of the algorithm, and (4) analysis of the results to see where further improvements might occur.