Tic Tac Toe with Minimax Algorithm

This project implements the classic game of Tic Tac Toe using the Minimax algorithm. The Minimax algorithm ensures that the AI player always makes the best possible move, making it unbeatable against a human player.

Overview

Tic Tac Toe is a two-player game where players take turns marking spaces on a 3x3 grid. The objective is to get three of your marks in a row horizontally, vertically, or diagonally before your opponent does.

Features

• Human vs. AI gameplay
• AI player uses the Minimax algorithm with Alpha-Beta Pruning for optimal decision-making
• Interactive command-line interface
• Displays the game board with numbered positions for easier input
• Supports multiple rounds of gameplay

How to Play

1. Clone the repository to your local machine.
2. Run the Tic-Tac-Toe-AI.py script in your Python environment.
3. Follow the prompts to input your moves when it's your turn.
4. The AI player will respond with its move, and the game continues until there's a winner or a tie.

Dependencies

This project requires Python 3.x to run.