Unverified50% confidenceFactExact time
Alpha-beta pruning can reduce the number of branches searched from b^d to close to b^(d/2), effectively nearly doubling the search depth with the same computational resources.
1
Sources
50%
Confidence
Long-term
Relevance
8/16/2026
First Seen
Sources
塞缪尔跳棋程序：机器学习的真正起点
Related Claims
Unverified可变粒度搜索（Variable Granularity Search）相比束搜索和DVTS等SOTA方案，实现约3%的准确率提升，同时减少52%的计算量71% similarUnverified移除歧义后所有模型准确率提升26.8至40.2个百分点，Gemini甚至达到81%，表明歧义是深度搜索代理最大性能瓶颈之一61% similarVerifiedINT4 quantization compresses neural network weights from FP32 to a 4-bit integer representation, reducing model size by approximately 8 times.56% similarUnverifiedTinyBERT通过两阶段知识蒸馏将参数压缩至1400万55% similarUnverifiedHybrid Search, which combines BM25 with vector retrieval, typically achieves a 10–20% improvement in recall over single retrieval methods in actual production environments.55% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/758711API
curl https://kongchang.com/api/v1/knowledge/claims/758711MCP
get_claim(id=758711)