Skip to main content
Erschienen in:
Buchtitelbild

2001 | OriginalPaper | Buchkapitel

A Least-Certainty Heuristic for Selective Search

verfasst von : Paul E. Utgoff, Richard P. Cochran

Erschienen in: Computers and Games

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
A Least-Certainty Heuristic for Selective Search
verfasst von
Paul E. Utgoff
Richard P. Cochran
Copyright-Jahr
2001
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-45579-5_1

Premium Partner