Author: Peter McKenzie
Date: 01:18:15 08/21/03
Go up one level in this thread
On August 20, 2003 at 22:03:13, Jaime Benito de Valle Ruiz wrote: >My program uses a normal pseudo-legal generator and another one for check >evasions (how original!). >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, Of course you could easily do a quick hack that counts the number of times the check evasion generator is called relative to the normal generator. If you do this, please post the results here :-) I'd guess the ration would be something like 1:20. That would mean that even if you can make the check evasion generator take zero time, overall move generation would only speed up 5%. So it seems potential gains are not huge in this area. cheers, Peter > 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! >If anyone has experience with tests in this sense I'd appreciate some advice, >especially if anyone knows what overall gains can I expect with a faster evasion >generation function. >Thanks in advance. >Regards, > > Jaime
This page took 0.01 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.