Python development of algorithm to find solution in pure strategies of antagonistic matrix game

The article provides an algorithm for finding the optimal solution to the matrix antagonistic game in pure strategies. The algorithm implements the search for the upper and lower prices of the matrix game by implementing the maximal and minimax strategies of the players. The algorithm is encoded using the functionality of the Python programming language. The algorithm is tested using a numerical example.