min·i·max / ˈminēˌmaks/ • n. Math. the lowest of a set of maximum values. Compare with maximin. ∎  [as adj.] denoting a method or strategy in game theory that minimizes the greatest risk to a participant in a game or other situation of conflict. ∎  [as adj.] denoting the theory that in a game with two players, a player's smallest possible maximum loss is equal to the same player's greatest possible minimum gain.

minimax A basic algorithm in artificial intelligence, in particular when constructing programs to play games such as chess. A tree of possible moves, alternating with possible opponent's moves, is constructed to some depth. Evaluation of the positions at the leaves is then passed back up the tree, choosing always the minimum evaluation for the opponent and the maximum for the program itself. See also computer chess.