This repository provides a working implementation of the Minimax algorithm applied to Tic-Tac-Toe. The algorithm recursively explores the game tree, alternating between maximizing and minimizing players, to determine the optimal move. It demonstrates fundamental AI concepts including game state representation, minimax decision-making, and terminal state evaluation with win/loss/draw outcomes.