Author: Graham Laight
Date: 11:02:50 05/15/01
Go up one level in this thread
On May 15, 2001 at 06:26:14, Ralf Elvsén wrote: >On May 15, 2001 at 06:03:11, Graham Laight wrote: > >>I still say it's quicker and easier to draw a graph of strength of players >>plotted against proportion of draws. >> >>Since I don't have a copy of chessbase, the graph below is based on guesswork >>rather than actual study - but here's a quick example of what it would probably >>look like: >> >>Percentage Of Draws >> >> >>100 | * >> | * >> | * >> | * >> | * >>75 | * >> | * >> | * >> | * >> | * >>50 | * >> | * >> | * >> | * >> | * >>25 | * >> |* >> | >> | >> | >>0 | >> ------------------------------------------------------ >> 1000 1500 2000 2500 3000 3500 >> >> Elo Rating >> >> > >Check out this: > >http://math.bu.edu/people/mg/ratings/Draws.jpg In view of the excitement that has been generated by discussions on the solvability of chess, a couple of poll questions come to mind which would test the views of the club on this issue: Question 1: In view of the fact that in chess, the ratio of draws increases with the Elo level of the players, what do you think the result of a chess game would be if both sides played as well as possible? * a win for white * a draw * a win for black * don't know * abstain Question 2: When will computers satisfactorily resolve whether chess is a ultimately a draw, or a win for either side with play that is free of mistakes? * within 10 years * within 50 years * within 100 years * within 1000 years * within 10000 years * within 100000 years * never * abstain -g
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.