Author: Tord Romstad
Date: 04:25:26 12/07/05
Go up one level in this thread
On December 07, 2005 at 05:31:51, Barry Culp wrote: >On December 06, 2005 at 23:11:38, Uri Blass wrote: > >>results of more matches >> >>Rybka(2 plies)-Movei(4 plies) 12.5-7.5 >>Rybka(3 plies)-Movei(5 plies) 7.5-12.5 >>Rybka(4 plies)-Movei(6 plies) 11-9 >>Rybka(5 plies)-Movei(7 plies) 10.5-9.5 > >What's the point of running these handicap matches ? Please explain It is commonly believed that the difference between a search to depth N and a search to depth (N+d) is less significant when N is big. This seems intuitively plausible, but as far as I know we don't have much experimental support for this hypothesis. Experiments like Uri's could help us to learn more about this. Tord
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.