Author: andrew tanner
Date: 05:31:46 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...!
This raises an interesting issue: Have there been efforts in the past made
by great mathematicians to develop equations that might provide solutions? This
looks like a solve for x type equation, where you could have many variables on
both sides of the equation and solve for the different variables using the most
important factored in piece of data..the endgame tablebase code. In other words,
because we know what the outcome of the game is, in terms of pefect endgame
play, then we should be able to mathematically deduce all the other unknowns
from that vital piece of information. Of course a computer would be needed then
to number crunch the equation using this large database of data.
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.