white chose to make, but there are about 20 or so moves white can make given the current board position, and then black has 20 or so moves it can make, and so on. This is how a computer looks at chess. It thinks about it in a world of "all possible moves," and it makes a big tree for all of those moves, like this: In this tree, there are Anthony accelerated dialup, Anthony, NM dialup accelerated AnthonyAnthony dialup, accelerated New Mexico, Anthony accelerated dialup
accelerated dialup Anthony |