September 2020
This project implements the Minimax algorithm in the Tic Tac Toe game using C++. It guarantees optimal play—ensuring that it never loses—by recursively evaluating possible moves to determine the best outcome.
The Minimax algorithm simulates all possible future game states and selects the move that leads to the best result. Given the limited number of combinations in Tic-Tac-Toe, there is no need for advanced optimizations such as full alpha-beta pruning.
Although the implementation does not use full alpha-beta pruning, it incorporates early return conditions to reduce the number of nodes analyzed. This recursive approach provides efficient performance without sacrificing accuracy.