takes the minimum): Finally, it takes the maximum of the top three numbers: 7. That is the move the computer will make. Once black makes its move, the computer goes through this whole process again, generating a new tree and evaluating all of the board positions to figure out its next move. This approach is called the minimax algorithm because it alternates between the maximums and minimums as it moves up Frankton 56k , Frankton, IN 56k FranktonFrankton , 56k Indiana, Frankton 56k
56k Frankton |
|
 |
|
