Sciweavers

Share
CG
2000
Springer

A Least-Certainty Heuristic for Selective Search

9 years 8 months ago
A Least-Certainty Heuristic for Selective Search
: 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 bestfirst minimax.
Paul E. Utgoff, Richard P. Cochran
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where CG
Authors Paul E. Utgoff, Richard P. Cochran
Comments (0)
books