Show simple item record

dc.contributor.authorSteinberg, Igoren_US
dc.contributor.authorSolomon, Marvin Hen_US
dc.description.abstractWe 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.en_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleSearching Game Trees in Parallelen_US
dc.typeTechnical Reporten_US

Files in this item


This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record