Minimax algorithm for tic tac toe in C

Question

I have made a basic tic tac toe game which fills the board with X's and O's and checks for a winner/draw. How can I implement the minimax algorithm to 1) check for the next best move when the game is at a certain state?2) play the full game from the start against an AI using the algorithm?

Answer 1

This is can be looked at as an adversarial problem, so you could use one of the Algorithms in that category.

Personally, I would use bayesian logic to compute the next probable move.