vanilla javascript TicTacToe game against AI

Play TicTacToe agains AI. The AI uses minmax algorithm. The minimax function recursively evaluates all possible moves and assigns a score to each move. The computer selects the move with the highest score. Note that the computer's moves are deterministic in this implementation, which means the computer will always make the optimal move. If you want to add more complexity or randomness to the computer's moves, you can modify the makeComputerMove function increasing or decreasing the depth.