Author: blass uri
Date: 07:29:06 06/09/99
Go up one level in this thread
On June 08, 1999 at 20:20:49, Peter Kappler wrote: >On June 08, 1999 at 17:31:47, Christoph Fieberg wrote: > > >> >>The gnawing question is: HOW HIGH IS THE MAXIMUM ELO NUMBER? >> > >I think this is an interesting question. > >Let's assume that Kasparov faced a computer opponent that played perfect chess - >i.e. it had the "ultimate tablebase". :-) > >Would Garry lose every game, or could he draw some games against a perfect >opponent? My guess is that the drawing margin in chess is large enough that >Kasparov would draw occasionally, but probably not more than 10% of the games. It is impossible to know because knowing that the computer is playing perfect chess is not enough to know the chance for a draw. I believe that there are many short draws with no mistake(the theoretical result is always a draw) and I do not know if there is a chance that the computer is going to choose one of them. I believe that many strong humans have a practical chance to get a short draw by repetition against a computer that play a perfect chess if it choose a random perfect move and does not use evaluation function to choose the best perfect move. 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.