Unverified60% confidenceFactExact time
The theoretical foundation of the minimax algorithm can be traced back to von Neumann's minimax theorem of 1928.
2
Sources
60%
Confidence
Long-term
Relevance
8/18/2026
First Seen
Sources
塞缪尔跳棋程序：机器学习的真正起点
Related Claims
UnverifiedMinimax算法最早可追溯到约翰·冯·诺伊曼1928年发表的博弈论奠基性论文75% similarUnverifiedThe minimax theorem was first proved by von Neumann in 1928, asserting that in a class of games satisfying convexity and compactness, minimax and maximin are equivalent.69% similarUnverifiedThe von Neumann architecture was proposed by mathematician John von Neumann in 1945.68% similarUnverifiedDomain decomposition methods have more than 30 years of development history in deterministic numerical computation, with classical representatives including the Schwarz alternating method proposed in 1870, the FETI method, and Balancing Domain Decomposition.67% similarUnverified大O符号由德国数学家保罗·巴赫曼于1894年引入，用于描述算法复杂度的渐近行为66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/766332API
curl https://kongchang.com/api/v1/knowledge/claims/766332MCP
get_claim(id=766332)