Reducing two person, zero sum games with underlying symmetry
Ken Pearson · Journal of the Australian Mathematical Society Series A Pure Mathematics and Statistics · 1982
Abstract We consider two person, zero sum games with several symmetries. Where such symmetries are present there is a group acting on the strategies of the game. We show how to use this action to produce a reduced game with a smaller matrix, but having the same value as the original game, and how to obtain optimal strategies for the original game from optimal strategies of the reduced game. An analysis of a simplified version of the popular game Mastermind is given to illustrate the theory developed.