This is a simple console-based Tic Tac Toe game where the player competes against the computer. The computer uses the Minimax algorithm with Alpha-Beta pruning to decide its moves optimally.
- Player can choose to go first or second.
- The computer makes optimal moves using the Minimax algorithm with Alpha-Beta pruning.
- The game checks for wins, draws, and invalid moves.
- Run the program.
- Choose whether you want to play first.
- Enter your move as a pair of numbers representing the row and column (both between 1 and 3).
- The computer will then make its move.
- The game will continue until there is a winner or the game is drawn.