Computer Chess Club Archives




Subject: Re: Verified Null-Move Pruning, ICGA 25(3)

Author: Uri Blass

Date: 03:58:49 11/22/02

Go up one level in this thread

On November 22, 2002 at 06:49:45, Gian-Carlo Pascutto wrote:

>On November 22, 2002 at 06:42:39, Omid David Tabibi wrote:
>>Comparing search times has the following problems:
>>1. It is not reproducible:
>>    - If you manage to speed up your program (without algorithmic change),
>>      the results will be different.
>Huh? You should never make such changes when you are already testing
>your algorithm!
>>    - If you move to another platform, the results will be different.
>Howso? The absolute times will be different yes. The ratios, not.

I do not agree that the ratio has to be the same.

It is possible that the change in the algorithm cause the computer to
have different ratio in speed between different hardwares.

I assume that in most of the cases the different is small but it does not say
that the ratio is the same.


This page took 0.15 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.