Search Control Methods in Deep Blue
@inproceedings{Campbell2002SearchCM, title={Search Control Methods in Deep Blue}, author={M. Campbell and A. J. Hoane and F. Hsu}, year={2002} }
The Deep Blue chess-playing system explores a huge search tree when selecting a move to play, typically examining on the order of 20 to 40 billion positions. Although a relatively complex evaluation function is applied to the leaf positions of this search tree, there is significant possibility of error in the evaluation function values. Incorrect position evaluation can lead to a poor move choice at the root of the search tree. We have developed methods to reduce the susceptibility of Deep Blue… Expand
4 Citations
Advances in Computer Games: 16th International Conference, ACG 2019, Macao, China, August 11–13, 2019, Revised Selected Papers
- Computer Science
- ACG
- 2020
- Highly Influenced
Building AI Applications: Yesterday, Today, and Tomorrow
- Engineering, Computer Science
- AI Mag.
- 2017
- 10
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 13 REFERENCES
The B* Tree Search Algorithm: A Best-First Proof Procedure
- Mathematics, Computer Science
- Artif. Intell.
- 1979
- 232
- PDF