Subscribe
Issue No.01 - January (1983 vol.5)
pp: 89-92
Raphael A. Finkel , Department of Computer Sciences, University of Wisconsin, Madison, WI 53706.
John P. Fishburn , Bell Laboratories, Murray Hill, NJ 07974.
ABSTRACT
In this paper we investigate the mandatory-work-first'' approach to parallel alpha-beta search first proposed by Akl, Barnard, and Doran. This approach is based on a version of alpha-beta search without deep cutoffs and a two-stage evaluation process, the second stage of which is often pruned. Our analysis shows that for best-first ordering on the lookahead tree, this approach provides greater speedup than the Palphabeta tree-splitting technique, and that for worst-first ordering, mandatory work first provides only slightly worse speedup than Palphabeta.
CITATION
Raphael A. Finkel, John P. Fishburn, "Improved Speedup Bounds for Parallel Alpha-Beta Search", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.5, no. 1, pp. 89-92, January 1983, doi:10.1109/TPAMI.1983.4767350