Description: This program implement minimax algorithm for caro game for two players, O and X, who take
turns marking the spaces in a n*n grid, assuming that O goes first. The player who succeeds in placing
five respective marks in a consecutive horizontal, vertical or diagonal row wins the game. Suppose O is
the minimizing player and X is the maximizing player.
To Search:
File list (Check if you may need any files):
caro.java