Min-max is a decision-making algorithm that uses decision theory, game theory, statistics, and philosophy to calculate the optimal move It is a two-player game. The mechanism evaluates minimum loss and maximum profit. This logic can also be extended to play the more complicated games like chess, checkers, etc.

In the Tic-Tac-Toe game, a player tries to ensure two cases:

• Maximize a player’s own chances of winning.

• Minimize the opponent’s chances of winning.

Maximize profit: The profit can be maximized by either fork or win.

Fork: Initially player will create an opportunity where he can win in two ways.

Win: If there are two same X or O in a row, then play the third to get three in a row.

Minimize Loss: The loss can be minimized by a block.

Block: If two ‘x’ or ‘o’ of the opponent are in a row then block it, or else block the opponent’s fork.

Note: Download the above pic by clicking on the attachment button below