Corpus ID: 9187594

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
Building AI Applications: Yesterday, Today, and Tomorrow
  • 10
  • Highly Influenced
  • PDF
Game Specific Approaches to Monte Carlo Tree Search for Dots and Boxes
  • 1

References

SHOWING 1-10 OF 13 REFERENCES
Conspiracy Numbers for Min-Max Search
  • 161
Are There Practical Alternatives To Alpha-Beta in Computer Chess?
  • 6
Darkthought Goes Deep
  • E. A. Heinz
  • Computer Science
  • J. Int. Comput. Games Assoc.
  • 1998
  • 17
B* Probability Based Search
  • 7
Programming a computer for playing chess
  • 891
  • PDF
An Analysis of Alpha-Beta Pruning
  • 971
The B* Tree Search Algorithm: A Best-First Proof Procedure
  • H. Berliner
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1979
  • 232
  • PDF
COMPUTER CHESS STRENGTH
  • 86
A Bayesian Approach to
  • 334
  • PDF
Extension Heuristics
  • 18
  • Highly Influential
...
1
2
...