Heuristic algorithms are put to the test in games. Because they incorporate an unexpected opponent, two-person games
are more challenging than a basic puzzle. In a two-player game, you must presume that your opponent has the same information
as you and can use it just as well. As a result, you must presume that your opponent will make the best available move at each
level of the game. The minimax method is built on this foundation. The players in minimax are referred to as MAX (the player)
and MIN (the player) (the opponent).