Author: Jaime Benito de Valle Ruiz
Date: 19:03:13 08/20/03
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, 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 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.