Author: Gian-Carlo Pascutto
Date: 04:10:17 11/22/02
Go up one level in this thread
On November 22, 2002 at 06:58:49, Uri Blass wrote: >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. You could make a change so that the algorithm stresses memory much more and it would run (relatively) slower on a computer that has slower ram compared to the CPU. This means the algorithm's efficiency is dependant on hardware. I think it would be very *good* if you would figure this out! -- GCP
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.