Author: stuart taylor
Date: 16:59:50 11/03/02
Go up one level in this thread
On November 03, 2002 at 05:20:31, Omid David wrote: > >The game of chess can never ever be solved: > >There are about 10^128 potential chess positions. If we start searching with a >supercomputer with the speed of 100 million nodes per second (10^8 NPS), it will >take about 10^113 years to process all possible positions! What is the speed you >can imagine in the next 100 years? Let's say 100 million million nodes per >second (10^14 NPS); then it will take "only" 10^107 years to solve the game of >chess! > >And even if we process all 10^128 possible positions, we will have one little >problem: where to store the data?! Even if we manage to store a position in an >atom, there won't be enough atoms for that, since there are "only" 10^80 atoms >in the entire universe...! I havn't studied computers, or even math in depth (but I can understand things quite well if explained). But I'm also concerned with the idea of solving chess, and who knows what chess would look like if really solved! Perhaps, with a great amount of study, many more rules can be discovered, and an extremely great amount of knowledge can be put into programs, so that, even if it is unreliable for a pentium 1 on 90Mhz. to make decent moves in one second, a super computer COULD proccess everything at an admirable speed, which would be plenty enough for it to proccess everything it needs to proccess for it's most qualitative moves. If Kasparov can be so selectve, and be about the greatest ever chess player, then if a computer is even 1% as intelligently selective as Kasparov, it could avoid ever being defeated by Kasparov, or another human. The question is WHICH knowledge, but I think that many new things could be discovered as to other great ideas to make rules about, for programming. S.Taylor
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.