Author: Sune Fischer
Date: 03:33:17 02/27/02
Go up one level in this thread
On February 26, 2002 at 14:35:32, Uri Blass wrote: >The difference in elo in order to win a match 2*10^1000-1 is certainly finite >and I believe that choosing a random move is going to be enough for better score >because I believe that it is possible to get at least a draw in less than 500 >moves and the probability to be lucky and choose every one of them is more than >1/100 in every move because I believe that the number of moves in every ply is >going to be less than 100 when the opponent choose the perfect strategy. Yes I agree, but much depends on what the *chess-tree* really lookes like. Maybe black has a forced draw in 30 moves? Maybe the forced draw is really 2000 moves? As you have previously pointet out yourself, the longer the game, the greater the chance that the weaker player will make a mistake. This will probably correlate directly to the rating of the perfect player, can he drag the game on forever his rating will be much higher. >It suggest the following question >suppose that A has rating 0(I believe that the player who choose random move >will have rating that is lower than 0). > >suppose B wins against A 2*10^1000-1 > >What is going to be the rating of B based on the elo formula? >This rating is probably an upper bound for the rating of the perfect player >if you assume that the perfect player plays only against A. > >Uri Why should it be an upper bound? Your rating should be a constant no matter who you play, if your opponent is weak you will win more games, but your expected score will also be that much higher. -S.
This page took 0.01 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.