A Least-Certainty Heuristic for Selective Search

Authors:
Paul E. Utgoff;Richard P. Cochran
Affiliations:
-;-
Venue:
CG '00 Revised Papers from the Second International Conference on Computers and Games
Year:
2000

Citing 8
Cited 0

Game tree searching by min/max approximation

Artificial Intelligence
Conspiracy numbers for min-max search

Artificial Intelligence
Conspiracy numbers

Artificial Intelligence - Special issue on computer chess
Singular extensions: adding selectivity to brute-force searching

Artificial Intelligence - Special issue on computer chess
Proof-number search

Artificial Intelligence
Best-first minimax search

Artificial Intelligence
B* probability based search

Artificial Intelligence
Learning to Predict by the Methods of Temporal Differences

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

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.