Author: Omid David Tabibi
Date: 08:53:20 12/18/02
Go up one level in this thread
On December 18, 2002 at 03:08:03, Bruce Moreland wrote: >On December 17, 2002 at 20:05:48, Omid David Tabibi wrote: > >>Thanks for your comments. We had a very thorough discussion of all the issues >>you've raised, several weeks ago (with interesting comments by Robert Hyatt, >>Gian-Carlo Pascutto, Tony Werten, Uri Blass, etc). I suggest that you first take >>a look at those discussions (check the archives of Nov. 20--30). >> >>Using fixed time instead of fixed depth incurs many problems, e.g., the >>experiment will not be repeatable, and will be heavily hardware dependant, in >>addition to dependance on engine's NPS. Because of all these reasons fixed depth >>experiments are used more frequently for algorithmic comparisons (e.g., see >>Heinz' articles as the most recent examples). > >I got the ICGA today, so this is the first I've heard of this article. I posted it on Nov. 20, under the subject: "Verified Null-Move Pruning, ICGA 25(3)". The intensive discussions lasted for over a week, and I was present about 24h/day, answering the questions. I suggest that you first review those discussions, as I can't afford the time to discuss them all over again. If you don't find your answer there, feel free to email me. Omid.
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.