Tic Tac Toe - AI

With Minimax and Alpha-Beta Pruning

This is a simple application of the Minimax algorithm in a Tic-Tac-Toe game made with Pygame.

The Minimax also has the Alpha-Beta Pruning optimization, wich allows faster plays by the AI.

Feel free to look the code and maybe understand more the minimax algorithm

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
.gitignore		.gitignore
README.md		README.md
ai.py		ai.py
cell.py		cell.py
gameManager.py		gameManager.py
main.py		main.py
requirements.txt		requirements.txt