This program solves an mxn two-person, zero-sum game. The payoff matrix for the row player must be in ANS upon running the program. The optimal row and column strategies are returned as well as the value of the game.
The program checks for strictly determined games and recessive rows and columns.