Computer Chess Club Archives




Subject: Re: Of course using search times it doesn't work

Author: Omid David Tabibi

Date: 02:59:55 11/22/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.

Read the article first.
I have compared search depths on a single program. This is the most accurate
algorithmic comparison method.

You frequently accuse people like Robert or yours truly, of "bad science". Could
you refer us to one of your publications which demonstrates "good science"?

This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.