Skip to main content
SpringerLink
Log in

A Least-Certainty Heuristic for Selective Search

  • Conference paper
  • First Online:
Computers and Games (CG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2063))

Included in the following conference series:

  • 881 Accesses

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.

Acknowledgments

This material is based on work supported by the National Science Foundation under Grant IRI-9711239. Rich Korf shared his code for efficient indexing of a random number sequence. Gang Ding, David Stracuzzi, and Margaret Connell provided helpful comments.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. V. Allis, M. van der Meulen, and H. J. van den Herik. Proof-number search. Artificial Intelligence, 66, 91–124, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. T. Anantharaman, M. S. Campbell, and F-h. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43, 99–109, 1990.

    Article  Google Scholar 

  3. H. Berliner. The B* tree search algorithm:A best-first proof procedure. Artificial Intelligence, 12, 23–40, 1979.

    Article  MathSciNet  Google Scholar 

  4. H. Berliner, and C. McConnell. B* probability based search. Artificial Intelligence, 86, 97–156, 1996.

    Article  Google Scholar 

  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. R. E. Korf, and D. M. Chickering. Best-first minimax search. Artificial Intelligence, 84, 299–337, 1996.

    Article  MathSciNet  Google Scholar 

  7. D. A. McAllester. Conspiracy numbers for min-max search. Artificial Intelligence, 35, 287–310, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. J. Palay. The B* tree search algorithm-new results. Artificial Intelligence, 19, 145–163, 1982.

    Article  Google Scholar 

  9. R. Rivest. Game tree searching by min/max approximation. Artificial Intelligence, 34, 77–96, 1988.

    Article  MathSciNet  Google Scholar 

  10. J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43, 67–84, 1990.

    Article  Google Scholar 

  11. R. S. Sutton. Learning to predict by the method of temporal differences. Machine Learning, 3, 9–44, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Massachusetts, Amherst, MA, 01003

    Paul E. Utgoff

Authors
  1. Paul E. Utgoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard P. Cochran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Alberta, Edmonton, Alberta, Canada

    Tony Marsland

  2. Future University - Hakodate, Hakodate, Hokkaido, Japan

    Ian Frank

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Utgoff, P.E., Cochran, R.P. (2001). A Least-Certainty Heuristic for Selective Search. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45579-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43080-3

  • Online ISBN: 978-3-540-45579-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation