the possible positions black will take (it takes the maximum): One level up, it assumes that black will choose 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 Long Branch dialup access, Long Branch, NJ access dialup Long BranchLong Branch access, dialup New Jersey, Long Branch dialup access
dialup access Long Branch |