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 evaluate millions of board positions per second. Once it generates the tree, then the computer needs to "evaluate the board positions." That is, the computer has to look dial up isp, , MA up isp dial up isp, dial Massachusetts, dial up isp
dial up isp |
