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 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 Chaplin 56k , Chaplin, KY 56k ChaplinChaplin , 56k Kentucky, Chaplin 56k
56k Chaplin |
|
 |
|
