Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: THE INEXHAUSTIBILITY OF CHESS

Author: William H Rogers

Date: 15:59:56 05/20/99

Go up one level in this thread


There is another exception. A few months ago, a game was won before the computer
ever left its book. Well, that is, when it finally got out of its opening book,
it ended up in its end game function and the game was won!!!
With the current progress in chess programs, I'll bet that most of chess will be
solved in a decade or two, at least serious chess. If we disreguard the useless
positons, then the normal game should be solveable. I think.
Then a little later, some chess problems were posted and the machines were
allowed to think > infinity... and many found mate in 30 or so.
As the compition in chess programming developes, chess is getting better all the
time. Don't forget that when the first calculations on the probability of
solving chess, the worlds biggest computer "ENIAC" only had 4k of memory.
IHM
Bill



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.