Author: Uri Blass
Date: 09:25:49 08/02/05
Go up one level in this thread
On August 02, 2005 at 11:12:38, Eberhard wrote: >Quantum computers could solve chess in combination with alpha-beta pruning >(iterative deepening), theoretically speaking. > >These techniques each reduce the average number of branches of the game tree by >2 - and jointly the combination appears to reduce the tree size to one that >might be completed in a practical time; about 10^(50/4) ~ 10^13 positions, which >could be completed on a single computer in a year at only ~100,000 positions per >second. > >http://en.wikipedia.org/wiki/Computer_chess I do not understand it. I read the following about quantum computers. Consider a problem that has these four properties: The only way to solve it is to guess answers repeatedly and check them There are n possible answers to check Every possible answer takes the same amount of time to check There are no clues about which answers might be better. Generating possibilities randomly is just as good as checking them in some special order It is claimed that quantum computers can solve the problem in O(n^0.5) and not in O(n) and it is against my common sense. The only way to solve the problem in O(n^0.5) that I can imagine is in case that the machine generate n^0.5 processors in n^0.5 time units when the processors can work in parallel but I think that generating x processors in x time units is impossible when x is big enough when if x is small enough generating 2^x prossesors may be possible because every proccesor may be programmed to generate 2 proccesors in 1 time unit and the 2 proccesir may genreate 4 processors in the next time unit and it may continue in that way until there is no more place for more processors. Uri
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.