This project is a classic implementation of the Tic-Tac-Toe game using Python, where the player competes against an AI opponent. The game is played in the terminal, and users make their moves by selecting positions on a 3x3 board. The AI uses the Minimax algorithm to make optimal decisions, ensuring it either wins or forces a draw. The algorithm evaluates all possible outcomes recursively, choosing moves that minimize the player’s chances of winning. The project includes full game logic: input handling, board display, win/draw detection, and alternating turns between the player and the computer. It was built using core Python concepts like lists, loops, conditionals, and recursion.