Solution of 3  3 games using graphical method
While graphical solution of 2n games is described in all OR text books, solution of games of size 33 and higher sizes is obtained using simplex method only. This paper describes a method of solving games of size 33 graphically. The basic principle is to consider the problem as a three-dimensional model, and to convert it into plan and elevation, and thereby obtaining the solution. Each strategy is represented by a plane, and the common point where these planes intersect, is the solution point. The location of the plan of the solution point in relation to the strategies decides the probabilities with which they are to be played, and the height of the solution point gives the value of the game. Extension of this method for solving games of size 3n is also discussed.
graphical solution game theory 33 games optimal strategy 3n games