Alpha-Beta Search Revisited

  • Paul Parkins
  • John A. Keane
Conference paper

DOI: 10.1007/3-540-45675-9_88

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2412)
Cite this paper as:
Parkins P., Keane J.A. (2002) Alpha-Beta Search Revisited. In: Yin H., Allinson N., Freeman R., Keane J., Hubbard S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg

Abstract

An algorithm, Aspiration Scout/MTD(f), is derived from an analysis of alpha-beta (α-β) tree search. When compared to its predecessors, it results in an average 10.1% reduction in search effort with a best case of 17.4%. 1 The search space is usually referred to as a tree, however in games such as chess and draughts it is actually a directed acyclic graph (DAG). Programs search a dynamically unfolding DAG.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Paul Parkins
    • 1
  • John A. Keane
    • 1
  1. 1.Department of ComputationUMISTManchesterUK

Personalised recommendations