Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about check evasion generation

Author: Steven Edwards

Date: 09:45:37 08/21/03

Go up one level in this thread


On August 20, 2003 at 22:03:13, Jaime Benito de Valle Ruiz wrote:

>I was about to spend long hours (rather days) doing nearly-impossible speed
>optimizations on the latter, when I start wondering if it's really worth the
>effort, since this generation function is probably called very few times
>compared to the "normal" one most of the time, and maybe an increase of speed
>-say 20%- in this function will have a negligible speed improvement during
>search in a normal game. It wouldn't be the first time that I waste a lot of
>time just to realize that my program can reach a certain depth in 5 secs instead
>of 5.001 sec!

You need to use some good profiling tools before spending much effort on speed
optimizations.  Simple guessing is rarely an effective software engineering
method.



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.