An approach to solving antagonistic games with a large number of pure strategies of the players

Abstract

In this paper we consider one of the possible ways of finding the optimal mixed strategies for solving antagonistic games with a large number of pure strategies of
the players. It consists of two stages: computer simulation of the game for constructing hypotheses and proofs of theorems formulated on the basis of the hypothesis. To construct hypotheses we use one of the systems of computer mathematics.