<![CDATA[Tic Tac Toe is a classic game that, despite its simplicity, presents a compelling structure for computational strategy analysis. This study aims to develop an artificial intelligence system capable of playing optimally using a recursive algorithmic approach. By implementing the Minimax algorithm, the system evaluates all possible moves and outcomes in each game state, allowing it to choose the most strategic action to secure a win or avoid a loss. The approach was tested through simulations against both human and computer opponents, showing that the recursive strategy effectively generates fast and accurate decisions. The results highlight that recursive algorithms can significantly enhance the performance of intelligent systems in solving deterministic, rule-based games.]]>
Copyrights © 2025
