This is a text-based Tic Tac Toe game where the bot makes decisions using the Minimax algorithm. The bot is designed to punish the player by always making optimal moves, ensuring it wins as quickly as possible. The game also features Alpha-Beta prunning, which eliminates unnecessary branches in the decision tree.
The game starts by asking the player who will play first.
0 - Bot
1 - Human
When the player wants to make a move, they must enter the coordinates of the cell in this format: "X,Y".
0,0 | 0,1 | 0,2
1,0 | 1,1 | 1,2
2,0 | 2,1 | 2,2