do is generate the board-position tree five or 10 or 20 moves into the future. Assuming that there are about 20 possible moves for any board position, a five-level tree contains 3,200,000 board positions. A 10-level tree contains about 10,000,000,000,000 (10 trillion) positions. The depth of the tree that a computer can calculate is controlled by the speed of the computer playing the game. The fastest chess computers can generate and Waterford Main dial up provider, Waterford Main, CA up provider dial Waterford MainWaterford Main up provider, dial California, Waterford Main dial up provider
dial up provider Waterford Main |
