Tic Tac Toe

×

How the AI Works

The Minimax AI is a decision-making algorithm commonly used in two-player, turn-based games like chess, tic-tac-toe, and checkers. It assumes both players will play optimally: one aims to maximize their score (the maximizing player), while the other aims to minimize it (the minimizing opponent).

The algorithm explores all possible moves and outcomes to construct a game tree, evaluating the value of each position through a scoring function. It then selects the move that maximizes the player’s chances of winning, assuming the opponent will also play optimally to minimize the player's advantage.