Minimax algorithm

I have just started a course on artificial intelligence. The course opens with an assignment where the student must implement the minimax algorithm and variations on the algorithm in order to play a reversi-like game. The game is called isolation and is very similiar to tron. Players make a move, rendering the previously occupied square unusuable for the duration of the game. The objective of the game is to prevent the opponent from making anymore moves. A computer player could employ the minimax algorithm to play. On the computer player's turn, the computer looks at all possible moves from the current state of the board and determines which possible move will result in the best outcome in the future.