Unverified50% confidenceFactExact time
Minimax是一种在零和博弈中寻找最优策略的搜索算法，通过递归假设对手采取对己方最不利的走法来计算最佳落子
1
Sources
50%
Confidence
Long-term
Relevance
8/28/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedChess AI typically uses the Minimax algorithm combined with Alpha-Beta pruning for decision-making, and for Gomoku it is also commonly paired with a heuristic evaluation function to score board positions.66% similarUnverifiedMiniMax has significant advantages in inference speed and usage cost, and can substantially reduce Agent operating costs.61% similarUnverifiedCompileIQ 采用智能搜索策略而非暴力穷举，类似于机器学习中的超参数优化思路，通过有限次数的编译-运行-评估循环逐步逼近最优解59% similarUnverifiedOptimize Anything unifies three optimization modes: single-task search, multi-task search, and generalization mode58% similarUnverified父子分块策略用小块做检索、用大块喂给模型，在检索精度和上下文完整性之间取得平衡56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/813476API
curl https://kongchang.com/api/v1/knowledge/claims/813476MCP
get_claim(id=813476)