Author: Severi Salminen
Date: 04:11:22 10/30/02
Go up one level in this thread
>iám trying to write an efficient SEE for my 0x88 based program. Until now have >not been very succesful, My current SEE reduces the qsearch about 25% but the >time speend doing the SEE almost equals the time gained by doing less qnodes. Could you please define precisely how you count qnodes? Where do you increment and what? >Any tips on writing an efficient SEE? Can you tell how you do it now? Severi
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.