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.

• Type: Conference
• Year: 2000
• Where: CG
• Authors: Paul E. Utgoff, Richard P. Cochran
• Keywords: Algorithm, Algorithm Reasons, CG 2000, Computer Graphics, Leaf Nodes