The steps of the method for solving m×2 games are as follows:
Step 1. Draw two vertical axes one unit apart. These two lines are 0 and 1.
Step 2. Take the probabilities of the two alternatives of the column player as q and (1-q), then expected pay-offs of row player for each strategy are expressed with equations.
Step 3. These equations are then plotted on the graph.
Step 4. Draw n straight lines for j=1, 2… n and determine the lowest point of the upper envelope obtained. This will be the minimax point.
Step 5. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.