Computer Chess Club Archives




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

Author: Gian-Carlo Pascutto

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

Go up one level in this thread

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.

>    - Even on the same very hardware with the same very program, you will
>      not get the exact results of the previous test.

Not exact, but close enough. Within 1% in my experience.

>2. It is not generic:
>    - dependant on your program's structure
>    - dependant on your program's speed

The same is true for other methods.

>    - dependant on your hardware

See above.

>3. It is not accurate:
>    I have conducted tests on thousands of positions during the past several
>    months. Sometimes the computer was busier, sometimes it crashed and I had
>    to restart it (Windows!), etc.

Use a dedicated computer. If Windows is causing problems, use a Unix box.


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