Mathwords logoMathwords

Optimal Pure Strategy — Definition, Formula & Example

An optimal pure strategy is one fixed move a player can use every time in a two-person zero-sum game and still get the best result possible against a smart opponent. Both players have optimal pure strategies exactly when the game has a saddle point (a strictly determined game).

Let A=[aij]A = [a_{ij}] be the payoff matrix of a two-person zero-sum game, with entries giving the row player's payoff. Row i∗i^* and column j∗j^* are optimal pure strategies when ai∗j∗a_{i^*j^*} is both the minimum of row i∗i^* and the maximum of column j∗j^*. Equivalently, max⁡imin⁡jaij=min⁡jmax⁡iaij\max_i \min_j a_{ij} = \min_j \max_i a_{ij}. This common number is the value of the game, and (i∗,j∗)(i^*, j^*) is a saddle point.

Key Formula

max⁡imin⁡jaij  =  min⁡jmax⁡iaij  =  ai∗j∗=v\max_i \min_j a_{ij} \;=\; \min_j \max_i a_{ij} \;=\; a_{i^*j^*} = v
Where:
  • aija_{ij} = Payoff to the row player when row plays ii and column plays jj
  • max⁡imin⁡jaij\max_i \min_j a_{ij} = Maximin: the largest of the row minimums (row player's guaranteed floor)
  • min⁡jmax⁡iaij\min_j \max_i a_{ij} = Minimax: the smallest of the column maximums (column player's guaranteed ceiling)
  • vv = Value of the game, the payoff at the saddle point (i∗,j∗)(i^*, j^*)

Worked Example

Problem: In a zero-sum game, the column player pays the row player the amount (in dollars) shown. Rows are R1,R2,R3R_1, R_2, R_3; columns are C1,C2,C3C_1, C_2, C_3. Find each player's optimal pure strategy, if one exists. A=[638524719]A = \begin{bmatrix} 6 & 3 & 8 \\ 5 & 2 & 4 \\ 7 & 1 & 9 \end{bmatrix}
Step 1: Find the minimum of each row. The row player picks the row with the largest minimum, so this is the maximin.
min⁡(R1)=3,  min⁡(R2)=2,  min⁡(R3)=1  ⇒  maximin=3\min(R_1)=3,\; \min(R_2)=2,\; \min(R_3)=1 \;\Rightarrow\; \text{maximin} = 3
Step 2: Find the maximum of each column. The column player picks the column with the smallest maximum, so this is the minimax.
max⁡(C1)=7,  max⁡(C2)=3,  max⁡(C3)=9  ⇒  minimax=3\max(C_1)=7,\; \max(C_2)=3,\; \max(C_3)=9 \;\Rightarrow\; \text{minimax} = 3
Step 3: The maximin equals the minimax, so a saddle point exists at (R1,C2)(R_1, C_2). The entry 33 is the smallest number in its row and the largest in its column.
a12=3=va_{12} = 3 = v
Answer: The row player's optimal pure strategy is R1R_1 and the column player's is C2C_2. The value of the game is $3, paid to the row player each round.

Why It Matters

In finite math and operations research courses, checking for a saddle point is a standard early step in solving a two-person zero-sum game. If one exists, you are done with simple arithmetic. If not, you must move on to mixed strategies, which require probabilities or linear programming.

Common Mistakes

Mistake: Assuming every zero-sum game has an optimal pure strategy.
Correction: Many games have no saddle point. In Matching Pennies, with matrix [1−1−11]\begin{bmatrix} 1 & -1 \\ -1 & 1 \end{bmatrix}, the maximin is −1-1 but the minimax is 11. Since they differ, there is no saddle point, so the players cannot both use optimal pure strategies; at least one of them must mix moves at random to play optimally.

Related Terms

  • Game Theory — Parent field that studies strategic games like these
  • Fair Game — A game whose expected net gain is zero for every player
  • Prisoner's Dilemma — Non-zero-sum game where individually best moves backfire
  • Payoff — Value measuring each outcome that strategies are compared by