Questions:

  1. Is it feasible for a computer program to hold all the possible game configurations for a game like chess or checkers?   [Answer]

  2. What two ways that a computer program can reduce the size of the game tree that it must search to find the goal state?   [Answer]

  3. Since the computer that played chess against Garry Kasparov could examine 200,000,000 moves per second, how is it possible that Kasparov could compete when he is only able to examine 3 moves per second?   [Answer]