DMCA
Searching Game Trees in Parallel * (1990)
| Citations: | 6 - 0 self |
BibTeX
@MISC{Steinberg90searchinggame,
author = {Igor Steinberg and Marvin Solomon},
title = {Searching Game Trees in Parallel *},
year = {1990}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 of efficiency as the number of processors increases. 1. Introduction Game playing programs require a great deal of computation and would thus appear to be an ideal candidate for parallel implementation. In fact, current champion chess-playing programs gene...
Keyphrases
game tree parallel implementation parallel game tree search single search current champion chess-playing program gene introduction game playing program available work equivalent increase random tree great deal actual game show potential speculative work processor increase algorithm er speculative loss rapid drop-off new parallel game-tree search algorithm mandatory work ideal candidate
