Author: Uri Blass
Date: 18:43:46 11/21/02
Go up one level in this thread
On November 21, 2002 at 21:38:43, Vincent Diepeveen wrote: >On November 20, 2002 at 16:55:41, Gian-Carlo Pascutto wrote: > >Of course it doesn't work for you. you compare searchtimes >with each other. In his article he compares search depths with >each other. He claims 10 ply fullwidth is better finding >a bit more at testsets than 10 ply >with nullmove for tactical reasons, >forgetting to tell of course what time it takes to get it. > >You are comparing search depths which is correct. He isn't. >See his article. He also did games and at least it was clearly superior in games relative to R=2. It may be interesting to find out if it is also superior in games relative to R=3 or relative to other algorithms. Uri
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.