Author: José Carlos
Date: 06:52:06 01/03/01
Lately, people have been talking here about significant results. I'm not really sure if probabilistic calculus is appropiate here, because chess games are not stocastic events. So, I suggest an experiment to mesure the probabilistic noise: -chose a random program and make it play itself. -write down the result after 10 games, 50 games, 100 games... It should tend to be an even result, and it would be possible to know how many games are needed to get a result with a certain degree of confidence. If we try this for several programs, and the results are similar, we can draw a conclusion, in comparison with pure probabilistic calculus. Does this idea make sense, or am I still sleeping? :) José C.
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.