syedali237 / tic-tac-toe_with_minimax_algo

Implementation of minimax algorithm on a tic-tac-toe game.

-----Tic Tac Toe with Minimax Algorithm-----

This repository contains a simple implementation of the classic Tic Tac Toe game using HTML, CSS, and JavaScript, enhanced with the Minimax algorithm for AI-based gameplay.

In this implementation, you can play against an AI opponent that uses the Minimax algorithm to determine its moves. The Minimax algorithm is a decision-making algorithm used in game theory to find the optimal move for a player, ensuring that the player maximizes their chances of winning while minimizing the opponent's chances.

How to Play:

1. Clone or download this repository to your local machine.
2. Open the tictactoe.html file in your web browser.
3. Select X or O.
4. Click on any empty square to place your mark.
5. The AI opponent will automatically make its move using the Minimax algorithm.
6. Continue playing until there's a winner or the game ends in a draw.