In the game of chess, there are (on average) about 35 moves a player can make. If we were going to have a player consider those potential moves and the 35 moves an opponent might make in response to those moves, the player would have to consider about 1,225 board positions:
If this same player were to consider the 35 moves he or she could make, plus the 35 moves an opponent might make in response to those moves, and then the 35 moves he or she might make in response to this opponent, the player would have to consider 42,875 board positions:
In 1997, Deep Blue could process about 200,000,000 board positions given the time it had to make its move against Kasparov
or 5 moves which would equate to 35x35x35x35x35. This is called the
brute force method where the computer's processing power determines how powerful its decision-making processing is.