Unverified50% confidenceFactExact time
When IBM's Deep Blue defeated Kasparov in 1997, it relied primarily on powerful computational force and carefully designed heuristic search algorithms.
1
Sources
50%
Confidence
Long-term
Relevance
9/5/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.63% similarUnverified启发式算法用于解决NP-hard等计算复杂性极高的问题，通过模拟退火、遗传算法、蒙特卡洛树搜索等技术在可接受时间内寻找近似解61% similarUnverifiedCompanies like Google, Microsoft, ByteDance, and Alibaba use algorithm coding problems for their first round of screening in campus recruitment55% similarUnverifiedLeetCode-style interviews originated from the standardized processes established by large Silicon Valley tech companies—especially Google and Meta—during periods of rapid expansion to screen candidates in bulk54% similarUnverified多臂老虎机算法（如UCB、Thompson Sampling）可在工具成功率不确定情况下做出兼顾探索与利用的决策，可应用于工具选择路由54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/860573API
curl https://kongchang.com/api/v1/knowledge/claims/860573MCP
get_claim(id=860573)