Advertisement

Multi-cut Pruning in Alpha-Beta Search

  • Yngvi Björnsson
  • Tony Marsland
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1558)

Abstract

The efficiency of the αβ-algorithm as a minimax search procedure can be attributed to its effective pruning at so called cut-nodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cut-nodes by expanding other move alternatives as well. Our results show a strong correlation between the number of promising move alternatives at cut-nodes and a new principal variation emerging. Furthermore, a new forward pruning method is introduced that uses this additional information to ignore potentially futile subtrees. We also provide experimental results with the new pruning method in the domain of chess.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T. Anantharaman. A Statistical Study of Selective Min-Max Search in Computer Chess. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA, May 1990.Google Scholar
  2. [2]
    T. Anantharaman, M. S. Campbell, and F. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43(1):99–109, 1990.CrossRefGoogle Scholar
  3. [3]
    D. E. Knuth and R. W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293–326, 1975.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    T. A. Marsland. Single-Agent and Game-Tree Search. In A. Kent and J. G. Williams, editors, Encyclopedia of Computer Science and Technology, volume 27, pages 317–336, New York, 1993. Marcel Dekker, Inc.Google Scholar
  5. [5]
    D. A. McAllester and D. Yuret. Alpha-beta-conspiracy search, 1993. URL: http://www.research.att.com/~dmac/abc.ps.
  6. [6]
    D. S. Nau. Pathology on game trees: A summary of results. In Proceedings of the ACM National Conference on Artificial Intelligence, pages 102–104, 1980.Google Scholar
  7. [7]
    A. Reinefeld. An improvement to the Scout tree search algorithm. ICCA Journal, 6(4):4–14, 1983.Google Scholar
  8. [8]
    J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(1):1203–1212, 1989.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Yngvi Björnsson
    • 1
  • Tony Marsland
    • 1
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations