About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SODA 1991
Conference paper
On the parallel complexity of evaluating game trees
Abstract
We consider efficient parallel algorithms for the evaluation of game trees. We prove an inherent limitation on the speedup achievable, and give an algorithm that achieves its best performance bounds on trees of the sort that are likely to arise in game-playing programs.