Tic Tac Toe with Minimax and Alpha-Beta Pruning
Overview
This project implements the classic game of Tic Tac Toe as an adversarial search problem, developing an AI player using the minimax algorithm with alpha-beta pruning. It allows for human vs. computer and computer vs. computer gameplay, with the game board printed on the console after every move.
Tools and Languages Used
- IDE: PyCharm
- Language: Python
- Documentation: MS Word