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 evaluate millions of board positions per second. Once Mc Clure broadband news, Mc Clure, IL news broadband Mc ClureMc Clure news, broadband Illinois, Mc Clure broadband news
broadband news Mc Clure |
