called the minimax algorithm because it alternates between the maximums and minimums as it moves up the tree. By applying a technique called alpha beta pruning, the algorithm can run about twice as fast and requires a lot less memory. As you can see, this process is completely mechanical and involves no thought. It is simply a brute force calculation that applies an evaluation function to all possible board positions in Plymouth 56k , Plymouth, IN 56k PlymouthPlymouth , 56k Indiana, Plymouth 56k
56k Plymouth |
|
 |
|
