Improved Speedup Bounds for Parallel Alpha–Beta Search

Raphael A. Finkel, John P. Fishburn

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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.

Original languageEnglish
Pages (from-to)89-92
Number of pages4
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number1
StatePublished - Jan 1983


  • Alpha–beta search
  • computer chess
  • multiprocessing
  • parallel algorithms

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics


Dive into the research topics of 'Improved Speedup Bounds for Parallel Alpha–Beta Search'. Together they form a unique fingerprint.

Cite this