Minimax

The maximin value is the highest value that the player can be sure to get without knowing the actions of the other players; equivalently, it is the lowest value the other players can force the player to receive when they know the player's action. Its formal definition is:^[3]

${\displaystyle {\underline {v_{i}}}=\max _{a_{i}}\min _{a_{-i}}{v_{i}(a_{i},a_{-i})}}$ 

Where:

• i is the index of the player of interest.
• ${\displaystyle -i}$  denotes all other players except player i.
• ${\displaystyle a_{i}}$  is the action taken by player i.
• ${\displaystyle a_{-i}}$  denotes the actions taken by all other players.
• ${\displaystyle v_{i}}$  is the value function of player i.

Calculating the maximin value of a player is done in a worst-case approach: for each possible action of the player, we check all possible actions of the other players and determine the worst possible combination of actions – the one that gives player i the smallest value. Then, we determine which action player i can take in order to make sure that this smallest value is the highest possible.

For example, consider the following game for two players, where the first player ("row player") may choose any of three moves, labelled T, M, or B, and the second player ("column player") may choose either of two moves, L or R. The result of the combination of both moves is expressed in a payoff table:

${\displaystyle {\begin{array}{c|cc}\hline &L&R\\\hline T&3,1&2,-20\\M&5,0&-10,1\\B&-100,2&4,4\\\hline \end{array}}}$ 

(where the first number in each of the cell is the pay-out of the row player and the second number is the pay-out of the column player).

For the sake of example, we consider only pure strategies. Check each player in turn:

• The row player can play T, which guarantees them a payoff of at least 2 (playing B is risky since it can lead to payoff −100, and playing M can result in a payoff of −10). Hence: ${\displaystyle {\underline {v_{row}}}=2}$ .
• The column player can play L and secure a payoff of at least 0 (playing R puts them in the risk of getting ${\displaystyle -20}$ ). Hence: ${\displaystyle {\underline {v_{col}}}=0}$ .

If both players play their respective maximin strategies ${\displaystyle (T,L)}$ , the payoff vector is ${\displaystyle (3,1)}$ .

The minimax value of a player is the smallest value that the other players can force the player to receive, without knowing the player's actions; equivalently, it is the largest value the player can be sure to get when they know the actions of the other players. Its formal definition is:^[3]

${\displaystyle {\overline {v_{i}}}=\min _{a_{-i}}\max _{a_{i}}{v_{i}(a_{i},a_{-i})}}$ 

The definition is very similar to that of the maximin value – only the order of the maximum and minimum operators is inverse. In the above example:

• The row player can get a maximum value of 4 (if the other player plays R) or 5 (if the other player plays L), so: ${\displaystyle {\overline {v_{row}}}=4\ .}$ 
• The column player can get a maximum value of 1 (if the other player plays T), 1 (if M) or 4 (if B). Hence: ${\displaystyle {\overline {v_{col}}}=1\ .}$ 

For every player i, the maximin is at most the minimax:

${\displaystyle {\underline {v_{i}}}\leq {\overline {v_{i}}}}$ 

Intuitively, in maximin the maximization comes after the minimization, so player i tries to maximize their value before knowing what the others will do; in minimax the maximization comes before the minimization, so player i is in a much better position – they maximize their value knowing what the others did.

Another way to understand the notation is by reading from right to left: When we write

${\displaystyle {\overline {v_{i}}}=\min _{a_{-i}}\max _{a_{i}}{v_{i}(a_{i},a_{-i})}=\min _{a_{-i}}{\Big (}\max _{a_{i}}{v_{i}(a_{i},a_{-i})}{\Big )}}$ 

the initial set of outcomes ${\displaystyle \ v_{i}(a_{i},a_{-i})\ }$  depends on both ${\displaystyle \ {a_{i}}\ }$  and ${\displaystyle \ {a_{-i}}\ .}$  We first marginalize away ${\displaystyle {a_{i}}}$  from ${\displaystyle v_{i}(a_{i},a_{-i})}$ , by maximizing over ${\displaystyle \ {a_{i}}\ }$  (for every possible value of ${\displaystyle {a_{-i}}}$ ) to yield a set of marginal outcomes ${\displaystyle \ v'_{i}(a_{-i})\,,}$  which depends only on ${\displaystyle \ {a_{-i}}\ .}$  We then minimize over ${\displaystyle \ {a_{-i}}\ }$  over these outcomes. (Conversely for maximin.)

Although it is always the case that ${\displaystyle \ {\underline {v_{row}}}\leq {\overline {v_{row}}}\ }$  and ${\displaystyle \ {\underline {v_{col}}}\leq {\overline {v_{col}}}\,,}$  the payoff vector resulting from both players playing their minimax strategies, ${\displaystyle \ (2,-20)\ }$  in the case of ${\displaystyle \ (T,R)\ }$  or ${\displaystyle (-10,1)}$  in the case of ${\displaystyle \ (M,R)\,,}$  cannot similarly be ranked against the payoff vector ${\displaystyle \ (3,1)\ }$  resulting from both players playing their maximin strategy.

In two-player zero-sum games, the minimax solution is the same as the Nash equilibrium.

In the context of zero-sum games, the minimax theorem is equivalent to:^{[4][failed verification]}

For every two-person zero-sum game with finitely many strategies, there exists a value V and a mixed strategy for each player, such that

(a) Given Player 2's strategy, the best payoff possible for Player 1 is V, and

(b) Given Player 1's strategy, the best payoff possible for Player 2 is −V.

Equivalently, Player 1's strategy guarantees them a payoff of V regardless of Player 2's strategy, and similarly Player 2 can guarantee themselves a payoff of −V. The name minimax arises because each player minimizes the maximum payoff possible for the other – since the game is zero-sum, they also minimize their own maximum loss (i.e., maximize their minimum payoff). See also example of a game without a value.

The following example of a zero-sum game, where A and B make simultaneous moves, illustrates maximin solutions. Suppose each player has three choices and consider the payoff matrix for A displayed on the table ("Payoff matrix for player A"). Assume the payoff matrix for B is the same matrix with the signs reversed (i.e., if the choices are A1 and B1 then B pays 3 to A). Then, the maximin choice for A is A2 since the worst possible result is then having to pay 1, while the simple maximin choice for B is B2 since the worst possible result is then no payment. However, this solution is not stable, since if B believes A will choose A2 then B will choose B1 to gain 1; then if A believes B will choose B1 then A will choose A1 to gain 3; and then B will choose B2; and eventually both players will realize the difficulty of making a choice. So a more stable strategy is needed.

Some choices are dominated by others and can be eliminated: A will not choose A3 since either A1 or A2 will produce a better result, no matter what B chooses; B will not choose B3 since some mixtures of B1 and B2 will produce a better result, no matter what A chooses.

Player A can avoid having to make an expected payment of more than ⁠1/ 3 ⁠ by choosing A1 with probability ⁠1/ 6 ⁠ and A2 with probability ⁠5/ 6 ⁠: The expected payoff for A would be   3 × ⁠1/ 6 ⁠ − 1 × ⁠5/ 6 ⁠ = ⁠−+1/ 3 ⁠   in case B chose B1 and   −2 × ⁠1/6 ⁠ + 0 × ⁠5/ 6 ⁠ = ⁠−+1/ 3 ⁠   in case B chose B2. Similarly, B can ensure an expected gain of at least ⁠1/ 3 ⁠, no matter what A chooses, by using a randomized strategy of choosing B1 with probability ⁠1/ 3 ⁠ and B2 with probability ⁠2/ 3 ⁠. These mixed minimax strategies cannot be improved and are now stable.

Frequently, in game theory, maximin is distinct from minimax. Minimax is used in zero-sum games to denote minimizing the opponent's maximum payoff. In a zero-sum game, this is identical to minimizing one's own maximum loss, and to maximizing one's own minimum gain.

"Maximin" is a term commonly used for non-zero-sum games to describe the strategy which maximizes one's own minimum payoff. In non-zero-sum games, this is not generally the same as minimizing the opponent's maximum gain, nor the same as the Nash equilibrium strategy.

The minimax values are very important in the theory of repeated games. One of the central theorems in this theory, the folk theorem, relies on the minimax values.

In combinatorial game theory, there is a minimax algorithm for game solutions.

A simple version of the minimax algorithm, stated below, deals with games such as tic-tac-toe, where each player can win, lose, or draw. If player A can win in one move, their best move is that winning move. If player B knows that one move will lead to the situation where player A can win in one move, while another move will lead to the situation where player A can, at best, draw, then player B's best move is the one leading to a draw. Late in the game, it's easy to see what the "best" move is. The minimax algorithm helps find the best move, by working backwards from the end of the game. At each step it assumes that player A is trying to maximize the chances of A winning, while on the next turn player B is trying to minimize the chances of A winning (i.e., to maximize B's own chances of winning).

A minimax algorithm^[5] is a recursive algorithm for choosing the next move in an n-player game, usually a two-player game. A value is associated with each position or state of the game. This value is computed by means of a position evaluation function and it indicates how good it would be for a player to reach that position. The player then makes the move that maximizes the minimum value of the position resulting from the opponent's possible following moves. If it is A's turn to move, A gives a value to each of their legal moves.

A possible allocation method consists in assigning a certain win for A as +1 and for B as −1. This leads to combinatorial game theory as developed by John H. Conway. An alternative is using a rule that if the result of a move is an immediate win for A, it is assigned positive infinity and if it is an immediate win for B, negative infinity. The value to A of any other move is the maximum of the values resulting from each of B's possible replies. For this reason, A is called the maximizing player and B is called the minimizing player, hence the name minimax algorithm. The above algorithm will assign a value of positive or negative infinity to any position since the value of every position will be the value of some final winning or losing position. Often this is generally only possible at the very end of complicated games such as chess or go, since it is not computationally feasible to look ahead as far as the completion of the game, except towards the end, and instead, positions are given finite values as estimates of the degree of belief that they will lead to a win for one player or another.

This can be extended if we can supply a heuristic evaluation function which gives values to non-final game states without considering all possible following complete sequences. We can then limit the minimax algorithm to look only at a certain number of moves ahead. This number is called the "look-ahead", measured in "plies". For example, the chess computer Deep Blue (the first one to beat a reigning world champion, Garry Kasparov at that time) looked ahead at least 12 plies, then applied a heuristic evaluation function.^[6]

The algorithm can be thought of as exploring the nodes of a game tree. The effective branching factor of the tree is the average number of children of each node (i.e., the average number of legal moves in a position). The number of nodes to be explored usually increases exponentially with the number of plies (it is less than exponential if evaluating forced moves or repeated positions). The number of nodes to be explored for the analysis of a game is therefore approximately the branching factor raised to the power of the number of plies. It is therefore impractical to completely analyze games such as chess using the minimax algorithm.

The performance of the naïve minimax algorithm may be improved dramatically, without affecting the result, by the use of alpha–beta pruning. Other heuristic pruning methods can also be used, but not all of them are guaranteed to give the same result as the unpruned search.

A naïve minimax algorithm may be trivially modified to additionally return an entire Principal Variation along with a minimax score.

The pseudocode for the depth-limited minimax algorithm is given below.

function minimax(node, depth, maximizingPlayer) is
    if depth = 0 or node is a terminal node then
        return the heuristic value of node
    if maximizingPlayer then
        value := −∞
        for each child of node do
            value := max(value, minimax(child, depth − 1, FALSE))
        return value
    else (* minimizing player *)
        value := +∞
        for each child of node do
            value := min(value, minimax(child, depth − 1, TRUE))
        return value

(* Initial call *)
minimax(origin, depth, TRUE)

The minimax function returns a heuristic value for leaf nodes (terminal nodes and nodes at the maximum search depth). Non-leaf nodes inherit their value from a descendant leaf node. The heuristic value is a score measuring the favorability of the node for the maximizing player. Hence nodes resulting in a favorable outcome, such as a win, for the maximizing player have higher scores than nodes more favorable for the minimizing player. The heuristic value for terminal (game ending) leaf nodes are scores corresponding to win, loss, or draw, for the maximizing player. For non terminal leaf nodes at the maximum search depth, an evaluation function estimates a heuristic value for the node. The quality of this estimate and the search depth determine the quality and accuracy of the final minimax result.

Minimax treats the two players (the maximizing player and the minimizing player) separately in its code. Based on the observation that ${\displaystyle \ \max(a,b)=-\min(-a,-b)\ ,}$  minimax may often be simplified into the negamax algorithm.

 

 

Suppose the game being played only has a maximum of two possible moves per player each turn. The algorithm generates the tree on the right, where the circles represent the moves of the player running the algorithm (maximizing player), and squares represent the moves of the opponent (minimizing player). Because of the limitation of computation resources, as explained above, the tree is limited to a look-ahead of 4 moves.

The algorithm evaluates each leaf node using a heuristic evaluation function, obtaining the values shown. The moves where the maximizing player wins are assigned with positive infinity, while the moves that lead to a win of the minimizing player are assigned with negative infinity. At level 3, the algorithm will choose, for each node, the smallest of the child node values, and assign it to that same node (e.g. the node on the left will choose the minimum between "10" and "+∞", therefore assigning the value "10" to itself). The next step, in level 2, consists of choosing for each node the largest of the child node values. Once again, the values are assigned to each parent node. The algorithm continues evaluating the maximum and minimum values of the child nodes alternately until it reaches the root node, where it chooses the move with the largest value (represented in the figure with a blue arrow). This is the move that the player should make in order to minimize the maximum possible loss.

Minimax theory has been extended to decisions where there is no other player, but where the consequences of decisions depend on unknown facts. For example, deciding to prospect for minerals entails a cost, which will be wasted if the minerals are not present, but will bring major rewards if they are. One approach is to treat this as a game against nature (see move by nature), and using a similar mindset as Murphy's law or resistentialism, take an approach which minimizes the maximum expected loss, using the same techniques as in the two-person zero-sum games.

In addition, expectiminimax trees have been developed, for two-player games in which chance (for example, dice) is a factor.

In classical statistical decision theory, we have an estimator ${\displaystyle \ \delta \ }$  that is used to estimate a parameter ${\displaystyle \ \theta \in \Theta \ .}$  We also assume a risk function ${\displaystyle \ R(\theta ,\delta )\ .}$  usually specified as the integral of a loss function. In this framework, ${\displaystyle \ {\tilde {\delta }}\ }$  is called minimax if it satisfies

${\displaystyle \sup _{\theta }R(\theta ,{\tilde {\delta }})=\inf _{\delta }\ \sup _{\theta }\ R(\theta ,\delta )\ .}$ 

An alternative criterion in the decision theoretic framework is the Bayes estimator in the presence of a prior distribution ${\displaystyle \Pi \ .}$  An estimator is Bayes if it minimizes the average risk

${\displaystyle \int _{\Theta }R(\theta ,\delta )\ \operatorname {d} \Pi (\theta )\ .}$ 

A key feature of minimax decision making is being non-probabilistic: in contrast to decisions using expected value or expected utility, it makes no assumptions about the probabilities of various outcomes, just scenario analysis of what the possible outcomes are. It is thus robust to changes in the assumptions, in contrast to these other decision techniques. Various extensions of this non-probabilistic approach exist, notably minimax regret and Info-gap decision theory.

Further, minimax only requires ordinal measurement (that outcomes be compared and ranked), not interval measurements (that outcomes include "how much better or worse"), and returns ordinal data, using only the modeled outcomes: the conclusion of a minimax analysis is: "this strategy is minimax, as the worst case is (outcome), which is less bad than any other strategy". Compare to expected value analysis, whose conclusion is of the form: "This strategy yields ℰ(X) = n ." Minimax thus can be used on ordinal data, and can be more transparent.

The concept of "lesser evil" voting (LEV) can be seen as a form of the minimax strategy where voters, when faced with two or more candidates, choose the one they perceive as the least harmful or the "lesser evil." To do so, "voting should not be viewed as a form of personal self-expression or moral judgement directed in retaliation towards major party candidates who fail to reflect our values, or of a corrupt system designed to limit choices to those acceptable to corporate elites," but rather as an opportunity to reduce harm or loss.^[7]

In philosophy, the term "maximin" is often used in the context of John Rawls's A Theory of Justice, where he refers to it in the context of The Difference Principle.^[8] Rawls defined this principle as the rule which states that social and economic inequalities should be arranged so that "they are to be of the greatest benefit to the least-advantaged members of society".^[9][10]

 

Look up minimax in Wiktionary, the free dictionary.

 

Wikiquote has quotations related to Minimax.

• "Minimax principle", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• "Mixed strategies". cut-the-knot.org. Curriculum: Games. — A visualization applet
• "Maximin principle". Dictionary of Philosophical Terms and Names. Archived from the original on 2006-03-07.
• "Minimax". Dictionary of Algorithms and Data Structures. US NIST.