Tic Tac Toe Minimax Algorithm

This project is a TicTacToe game against an AI opponent that is impossible to beat.

Introduction

This project was created to practice my algorithmic skills, it implements the MiniMax algorithm for the AI which calculates all possible values and returns the best moves based on each outcome, it tries to maximise the outcome each move.

Installation

To install Project Title, follow these steps:

1. Clone the repository: git clone https://github.com/username/ttt-minimax-algorithm.git
2. Navigate to the project directory: cd ttt-minimax-algorithm
3. Install dependencies: npm install

Usage

To use Tic Tac Toe Minimax Algorithm, follow these steps:

1. Open the project in your favorite code editor.
2. Modify the source code to fit your needs.
3. Run the project npm run dev

Contributing

If you'd like to contribute to Project Title, here are some guidelines:

1. Fork the repository.
2. Create a new branch for your changes.
3. Make your changes.
4. Write tests to cover your changes.
5. Run the tests to ensure they pass.
6. Commit your changes.
7. Push your changes to your forked repository.
8. Submit a pull request.

License

Project Title is released under the MIT License. See the LICENSE file for details.

Authors and Acknowledgment

Project Title was created by Rakibul Bhuiyan.

FAQ

Q: What was used for the backend code?

A: I used Next.js' Server Actions so it was coded in TypeScript.

Contact

If you have any questions or comments about Project Title, please contact Rakibul Bhuiyan.