Author: José de Jesús García Ruvalcaba
Date: 04:09:11 03/04/02
Go up one level in this thread
On March 03, 2002 at 06:03:47, Uri Blass wrote: >suppose you have the following 1000 programs: > >program A0:play random moves with probability of 100% >program A1:does a search of 3 plies to choose the move in 0.1% of the cases >and plays a random move in the rest of the cases > >program A2:does a search of 3 plies to choose the move in 0.2% of the cases >and plays a random move in the rest of the cases > >... > > >program A999 does a search of 3 plies to choose the move in 99.9% of the cases >and plays a random move in the rest of the cases. > >programA1000 does a 3 ply search in every move. > >Questions: >1)suppose you play 1000 matches of 1000 games between programs >Ai and Ai+1(i=0...999) and suppose the rating of A0 is 0. > >suppose that you caluclate for every i rating based on the performance > >What is going to be the expected rating of program A1000? > >2)Suppose you play 1000 games between program Ai and Ai+2(i=0,2,4...998) >and suppose the rating of program A0 is 0 > >What is going to be the expected rating of program A1000 based on similiar >calculations? >In which case the expected that the rating is going to be higher? > >Uri You can easily make this experiment with your own engine. The programming part sounds quite trivial, but it would take quite long to run on a computer. I expect A1000 to get a higher rating in question 2) José.
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.