The method of Brown-Robinson - is an iterative procedure for constructing a sequence of pairs of mixed strategies of players converges to the solution of the matrix game.
Given a game with payoff matrix Aij, then one way of finding the optimal strategy consists in the fact that the game had played a lot of times, each time choosing the pure strategy that is most appropriate, based on the best of the accumulated result for all the previous games.
The relative frequency of use of these strategies determine an approximate solution of the game.
This application allows you to calculate the optimal strategy for each player, the price of the game and displays the results in a table.
WARNING! ! ! In order to save time and memory your android-device software algorithm implementation is limited to 300 steps.