Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Reproducibility of Nunn matches is not so good

Author: Georg v. Zimmermann

Date: 00:29:51 05/02/00

Go up one level in this thread


On May 02, 2000 at 03:24:19, Ulrich Tuerke wrote:

>On May 02, 2000 at 02:59:24, Dann Corbit wrote:
>
>>A coin is approximately fair.
>>
>>Flip it 20 times.  Heads is program A.  Tails is program B.  The odds of exactly
>>10:10 is very, very low.
>>
>>Try repeating the experiment ten times.  You may be surprised at the wide
>>variety that you see.
>>
>>This is reflected in the results for nearly equal programs.
>
>After all, the search algo of a chess program is completely deterministic, isn't
>it ?
>Why do you compare with flipping coins, Dann ?
>
>Regards, Uli

A small difference (happens all the time : Computer is a bit faster / slower,
initial swaping, a bit less time, HT filled with a different numbers, parallel
randomness .... ) can result in a different move which will result in a
different game.

Ever heared of Chaos Theory ? :-)

Sincerely,
Butterfly



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.