Computer Sciences Dept.

Searching Game Trees in Parallel

Igor Steinberg and Marvin H Solomon
1989

We present a new parallel game-tree search algorithm. Our approach classifies a processorís available work as either mandatory (necessary for the solution) or speculative (may be necessary for the solution). Due to the nature of parallel game tree search, it is not possible to keep all processors busy with mandatory work. Our algorithm ER allows potential speculative work to be dynamically ordered, thereby reducing starvation without incurring an equivalent increase in speculative loss. Measurements of ERís performance on both random trees and trees from an actual game, show that at least 16 processors can be applied profitably to a single search. These results contrast with previously published studies, which report a rapid drop-off efficiency as the number of processors increases.

Download this report (PDF)


Return to tech report index

 
Computer Science | UW Home