Saddle-Point

Monolithic Program to find first saddle point or optimal strategy for 2-Persons-Zero-Sum Game Finding one optimal strategy or saddle point

Saddle point = (Ai,Bj)=> saddle point is at (i-th Row,j-th Column) of the augmented pay-off matrix
Test Case 1

Test Case 2

Test Case 3

  Enter
1.)Number of rows
2.)Number of columns
3
3
0
1
1
-1
0
-1
-1
1
0
---------------------------------------The Pay-off Matrix that you entered is:---------------------------------------
               0               1               1

              -1               0              -1

              -1               1               0

            Row-minimums are: 0 -1 -1
            Column-maximums are: 0 1 1
            Maximum of rowmins is : 0


            Minimum of colmax is : 0

             Saddle point for this game is (A1,B1) and a(1,1) = 0


             Saddle point exists for this Payoff matrix
            Value of Game = 0

            The match is draw