the worst possible position for white (it 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 Nolan broadband , Nolan, TX broadband NolanNolan , broadband Texas, Nolan broadband
broadband Nolan |
