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% similarUnverifiedCommon hyperparameter tuning strategies include grid search, random search, and Bayesian optimization; the latter models historical evaluation results to guide the next sampling and typically achieves better results with fewer trials.70% similarUnverifiedTest-time search refers to the AI running a search process in real time during the inference phase of actual gameplay (such as Monte Carlo Tree Search) to find better moves, which in hidden-information scenarios requires simultaneously traversing multiple possible opponent state combinations68% similarUnverified多臂老虎机算法（如UCB、Thompson Sampling）可在工具成功率不确定情况下做出兼顾探索与利用的决策，可应用于工具选择路由68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/907341API
curl https://kongchang.com/api/v1/knowledge/claims/907341MCP
get_claim(id=907341)