You will have one tree. The values in the tree wil be a rating of the board. For example, if a particular move will make you lose then the value would be zero. If the move will make you win then the value would be the highest possible. The minimax algorithm picks the route that the computer wants to take by picking trying the moves that will yield the highest state for the computer. It then assumes that the human will pick the move that minimizes the computer's state.

So for simplicity its a computer vs human match. Obviously the algorithm is for a computer move decision. So when the computer has to play its move, is the root of the tree (MAX) the humans last move (a thus current game depth) ?

The root is a single number. Pretend you are rating the board on a scale from 0 to 10 based on how sure you are that you will win. That rating for the current board is the root. All the following numbers are ratings.

Hi there...The only language i know is C .Am 18 years old so now i started to learn.I have to make minimax function for othello(reversi). I have understand the way it works,but i can not make it.Code many times is more helpful than words :-)