Verified80% confidenceFactExact time
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.
7
Sources
80%
Confidence
Long-term
Relevance
9/11/2026
First Seen
Sources
Related Entities
Related Claims
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.78% similarUnverified多臂老虎机算法（如UCB、Thompson Sampling）可在工具成功率不确定情况下做出兼顾探索与利用的决策，可应用于工具选择路由68% similarUnverifiedWhen IBM's Deep Blue defeated Kasparov in 1997, it relied primarily on powerful computational force and carefully designed heuristic search algorithms.68% similarUnverifiedThe ultra-fast mode supports concurrent searches, enabling engineers to investigate multiple leads simultaneously rather than sequentially one by one.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/907341API
curl https://kongchang.com/api/v1/knowledge/claims/907341MCP
get_claim(id=907341)