News
The celebrated minimax principle of Yao (1977) says that for any Boolean-valued function f with finite domain, there is a distribution μ over the domain of f su ...
Nonconvex-concave (NC-C) finite-sum minimax problems have broad applications in decentralized optimization and various machine learning tasks. However, the nonsmooth nature of NC-C problems makes it ...
Tic Tac Toe game featuring an AI opponent using the Minimax algorithm with alpha-beta pruning to play optimally and never lose. Implemented with Python and Pygame with a clean graphical interface.
MiniMax, a unicorn valued at US$2.5 billion, was in the ‘early stage’ of preparations for the listing, according to news outlet The Paper.
A Python framework to build solo or multiplayer perfect-information games, and design solvers or AI bots using algorithms like Backtracking, Pathfinding, Minimax, MCTS, or Neural Networks.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results