A terminal-based Tic-Tac-Toe game with an AI opponent implemented using the Minimax algorithm enhanced with alpha-beta pruning. This project was developed as part of the Algorithm Design course at Wrocław University of Science and Technology.
The project demonstrates basic concepts of game AI and decision-making algorithms.
- Classic Tic-Tac-Toe gameplay
- Single-player mode against AI
- AI uses Minimax algorithm with alpha-beta pruning
- Simple text-based (terminal) user interface
- Clone the repository:
git clone https://github.com/MANDRW/TicTacToe-MinMax.git