Deep Blue
A chess-playing computer developed by IBM. In 1997, it defeated reigning world champion Garry Kasparov by a score of 3.5 to 2.5, becoming the first computer to defeat a top-level human player under standard tournament conditions.
Core Facts
Deep Blue primarily relies on search algorithms, pre-analyzing a large number of possible board positions and selecting the move with a higher win rate based on preset evaluation rules.
In 1997, IBM's Deep Blue defeated chess champion Garry Kasparov.
1997年IBM深蓝击败国际象棋世界冠军卡斯帕罗夫，采用暴力搜索算法
Timeline (last 90 days)
Deep Blue's defeat of Kasparov relied on chess evaluation rules written by human engineers and powerful computing power, rather than learning autonomously from game data, and it belongs to the symbolic learning/expert system category.
The breakthrough of large language models in code generation is structurally similar to Deep Blue's breakthrough in chess: both surpass humans on quantifiable specific tasks, yet neither can replicate the more complex judgment and accountability systems behind the profession.
Deep Blue was the first computer to defeat a top human chess player under standard tournament rules.
Deep Blue is a chess-dedicated computer developed by IBM that defeated world champion Garry Kasparov in 1997 with a final score of 3.5 to 2.5.
Deep Blue relies mainly on brute-force search, exhaustively computing optimal solutions within a limited depth via dedicated chips, and is essentially rule-driven computation.
Deep Blue primarily relies on search algorithms, pre-analyzing a large number of possible board positions and selecting the move with a higher win rate based on preset evaluation rules.
When IBM's Deep Blue defeated Kasparov in 1997, it relied primarily on powerful computational force and carefully designed heuristic search algorithms.
Deep Blue could evaluate approximately 200 million chess positions per second, employed an Alpha-Beta pruning search algorithm, and was equipped with 480 dedicated chips.
Deep Blue could evaluate approximately 200 million chess positions per second, employed an Alpha-Beta pruning search algorithm, and was equipped with 480 dedicated chips with hardware-level optimization for chess evaluation functions.
In 1997, IBM's Deep Blue defeated chess champion Garry Kasparov.
1 more timeline events
All Facts (12)
Deep Blue primarily relies on search algorithms, pre-analyzing a large number of possible board positions and selecting the move with a higher win rate based on preset evaluation rules.
80%VerifiedIn 1997, IBM's Deep Blue defeated chess champion Garry Kasparov.
70%Verified1997年IBM深蓝击败国际象棋世界冠军卡斯帕罗夫，采用暴力搜索算法
65%UnverifiedDeep Blue's defeat of Kasparov relied on chess evaluation rules written by human engineers and powerful computing power, rather than learning autonomously from game data, and it belongs to the symbolic learning/expert system category.
50%UnverifiedDeep Blue is a chess-dedicated computer developed by IBM that defeated world champion Garry Kasparov in 1997 with a final score of 3.5 to 2.5.
50%UnverifiedThe breakthrough of large language models in code generation is structurally similar to Deep Blue's breakthrough in chess: both surpass humans on quantifiable specific tasks, yet neither can replicate the more complex judgment and accountability systems behind the profession.
50%UnverifiedDeep Blue was the first computer to defeat a top human chess player under standard tournament rules.
50%UnverifiedDeep Blue relies mainly on brute-force search, exhaustively computing optimal solutions within a limited depth via dedicated chips, and is essentially rule-driven computation.
50%UnverifiedWhen IBM's Deep Blue defeated Kasparov in 1997, it relied primarily on powerful computational force and carefully designed heuristic search algorithms.
50%UnverifiedDeep Blue could evaluate approximately 200 million chess positions per second, employed an Alpha-Beta pruning search algorithm, and was equipped with 480 dedicated chips.
50%UnverifiedDeep Blue could evaluate approximately 200 million chess positions per second, employed an Alpha-Beta pruning search algorithm, and was equipped with 480 dedicated chips with hardware-level optimization for chess evaluation functions.
50%Unverified深蓝每秒能评估约2亿个棋局位置，其评估函数包含超过8000个特征参数
50%