Advertisement

A Least-Certainty Heuristic for Selective Search

  • Paul E. Utgoff
  • Richard P. Cochran
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2063)

Abstract

We present a new algorithm for selective search by iterative expansion of leaf nodes. The algorithm reasons with leaf evaluations in a way that leads to high confidence in the choice of move at the root. Performance of the algorithm is measured under a variety of conditions, as compared to minimax with α/ß pruning, and to best-first minimax.

Keywords

Selective search evaluation function error misordering assumption certainty confidence swing evaluation goal swing threshold LCF random trees artificial time Amazons Othello 
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.
    L. V. Allis, M. van der Meulen, and H. J. van den Herik. Proof-number search. Artificial Intelligence, 66, 91–124, 1994.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    T. Anantharaman, M. S. Campbell, and F-h. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43, 99–109, 1990.CrossRefGoogle Scholar
  3. 3.
    H. Berliner. The B* tree search algorithm:A best-first proof procedure. Artificial Intelligence, 12, 23–40, 1979.CrossRefMathSciNetGoogle Scholar
  4. 4.
    H. Berliner, and C. McConnell. B* probability based search. Artificial Intelligence, 86, 97–156, 1996.CrossRefGoogle Scholar
  5. 5.
    M. Buro. Experiment with multi-Probcut and a new high-quality evaluation function for othello. Proceedings of theWorkshop on Game-Tree Search. Princeton: NEC Research Institute, 1997.Google Scholar
  6. 6.
    R. E. Korf, and D. M. Chickering. Best-first minimax search. Artificial Intelligence, 84, 299–337, 1996.CrossRefMathSciNetGoogle Scholar
  7. 7.
    D. A. McAllester. Conspiracy numbers for min-max search. Artificial Intelligence, 35, 287–310, 1988.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    A. J. Palay. The B* tree search algorithm-new results. Artificial Intelligence, 19, 145–163, 1982.CrossRefGoogle Scholar
  9. 9.
    R. Rivest. Game tree searching by min/max approximation. Artificial Intelligence, 34, 77–96, 1988.CrossRefMathSciNetGoogle Scholar
  10. 10.
    J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43, 67–84, 1990.CrossRefGoogle Scholar
  11. 11.
    R. S. Sutton. Learning to predict by the method of temporal differences. Machine Learning, 3, 9–44, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Paul E. Utgoff
    • 1
  • Richard P. Cochran
  1. 1.Department of Computer ScienceUniversity of MassachusettsAmherst

Personalised recommendations