Computer Chess Club Archives




Subject: Re: Secrets of Rybka and Fruit from my point of view

Author: Peter Kappler

Date: 11:38:25 12/17/05

Go up one level in this thread

On December 16, 2005 at 15:35:55, Vasik Rajlich wrote:

>Another topic we need some data about. Was it ever proven that engine
>differences are magnified at shorter time controls? It's not obvious to me.

Have you read this paper?

A New Self-Play Experiment in Computer Chess
[M.I.T. LCS Technical Memo 608 / MIT-LCS-TM-608]
Ernst A. Heinz M.I.T. Laboratory for Computer Science (Room NE 43 - 228)
May 20, 2000

Abstract. This paper presents the results of a new self-play experiment in
computer chess. It is the first such experiment ever to feature search depths
beyond 9 plies and thousands of games for every single match. Overall, we
executed 17,150 self-play games (1,050-3,000 per match) in one "calibration"
match and seven "depth X+1 , X" handicap matches at fixed iteration depths
ranging from 5-12 plies. For the experiment to be realistic and independently
repeatable, we relied on a state-of-the-art commercial contestant: Fritz 6, one
of the strongest modern chess pro- grams available. The main result of our new
experiment is that it shows the existence of diminishing returns for additional
search in computer chess self-play by Fritz 6 with 95% statistical confidence.
The dimin- ishing returns manifest themselves by declining rates of won games
and reversely increasing rates of drawn games for the deeper searching pro- gram
versions. The rate of lost games, however, remains quite steady for the whole
depth range of 5-12 plies.


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.