Singular extensions: adding selectivity to brute-force searching
Artificial Intelligence - Special issue on computer chess
Kasparov VS. Deeper Blue: The Ultimate Man VS. Machine Challenge
Kasparov VS. Deeper Blue: The Ultimate Man VS. Machine Challenge
Kasparov Vs. Deep Blue: Computer Chess Comes of Age
Kasparov Vs. Deep Blue: Computer Chess Comes of Age
Modeling Biomolecules: Larger Scales, Longer Durations
IEEE Computational Science & Engineering
IEEE Computational Science & Engineering
Computational Methods in Finance: Option Pricing
IEEE Computational Science & Engineering
Data Mining: An Industrial Research Perspective
IEEE Computational Science & Engineering
TRIPs: an integrated intelligent problem-solving assistant
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
An Investigation of an Adaptive Poker Player
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Shogi Processor with a Field Programmable Gate Array
CG '00 Revised Papers from the Second International Conference on Computers and Games
Artificial intelligence for design
Formal engineering design synthesis
CG '08 Proceedings of the 6th international conference on Computers and Games
An efficient hybrid algorithm to evolve an Awale player
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
| Hi-index | 4.10 |
When IBM's Deep Blue rocked the chess world by defeating World Champion Garry Kasparov in a regulation match, many attributed the win to sheer hardware power. Because Deep Blue can evaluate 200 million moves per second, one observer said it had won by packing 380 years of human thought into three minutes. Improved hardware certainly did play a role in the victory, but brute-force calculations alone are not the whole story. To win, Deep Blue combined sheer speed and the ability to manage the complexity of searching these combinations. Its optimized game tree search employed evaluation functions tuned with expert knowledge from human grand masters. This article details the synergism of software algorithms and hardware strategies that the Deep Blue team used to beat Kasparov. Kasparov himself hinted at the rest of the story when he said Deep Blue was making human moves. This observation underscores the role software played in capturing the human expertise.