Unverified50% confidenceFactExact time
Minimax search recursively expands the game tree, taking the maximum value on one's own turn and the minimum value on the opponent's turn, to back-propagate the current optimal move.
1
Sources
50%
Confidence
Long-term
Relevance
9/21/2026
First Seen
Sources
Related Entities
Related Claims
Unverified随机搜索在高维空间中比网格搜索效率更高，因为实践中通常只有少数超参数对性能影响显著65% similarUnverified该方案选用小而快的检索模型，重建索引不到一秒，属于选择速度而非完美的权衡63% similarUnverifiedBreadth-first search (BFS) can guarantee finding the solution with the fewest steps, but consumes enormous memory.61% similarUnverifiedSamuel's program used minimax search for forward lookahead and employed an early form of alpha-beta pruning to reduce the search space.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/937888API
curl https://kongchang.com/api/v1/knowledge/claims/937888MCP
get_claim(id=937888)