Unverified50% confidenceFactExact time
Under optimal move ordering, Alpha-Beta pruning can reduce the effective branching factor of the search from b to √b, which is equivalent to doubling the search depth in the same amount of time.
1
Sources
50%
Confidence
Long-term
Relevance
8/28/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedAlpha-Beta剪枝通过维护α和β边界值剪除无用分支，理论上可将搜索节点数从O(b^d)压缩至O(b^(d/2))78% similarUnverifiedDS Spark的Markov head采用Rank 256低秩矩阵实现顺序条件依赖，额外计算开销压缩在1%量级以内55% similarUnverified推理端优化技术包括量化、知识蒸馏和KV Cache，量化可将参数从32位或16位浮点压缩为8位甚至4位整数55% similarUnverifiedBraTS uses the Dice similarity coefficient (range 0–1, higher is better) and Hausdorff distance (lower is better) as unified evaluation metrics.53% similarUnverifiedUsing double to accelerate 32-bit integer division is relatively safe, whereas 64-bit integer division (maximum value approximately 9.2×10^18) exceeds the range that double can represent exactly and requires caution.53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/815097API
curl https://kongchang.com/api/v1/knowledge/claims/815097MCP
get_claim(id=815097)