Definitions for "Minimax"
A criterion that minimizes the maximum opportunity loss.
A strategy to determine good moves in computer game playing by choosing the move that minimizes the loss the player can expect to incur, under the assumption that the player's opponent is adopting the same strategy (and hence trying to cause the maximum loss). The possible gain or loss for a sequence of moves is usually assessed using a static evaluation function applied to the state of play at the end of the sequence. See also Dynamic Value.
Minimax (sometimes minmax) is a method in decision theory for minimizing the maximum possible loss. Alternatively, it can be thought of as maximizing the minimum gain (maximin). It started from two player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves.
The objective is, itself, the value of another mathematical program: f(x) = Sup{F(x, y): y in Y(x), G(x, y) = 0, H(x, y) = 0}. Then, the objective is to minimize f(x) (on some feasible region).
Keywords:  algorithm, tree, game, determine, value
(n.)algorithm used to determine the value of a game tree.