Author: JW de Kort
Date: 05:17:51 10/30/02
Go up one level in this thread
On October 30, 2002 at 07:11:22, Severi Salminen wrote: >>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? Every time qsearch is called i count one node. > >>Any tips on writing an efficient SEE? > >Can you tell how you do it now? I could but i use a very difficult methode for which i'am not even sure that the results are correct. Basically i first fill up a matrix where for every ray the attackers are stored in attacking order. Then i cycle through this array to find the least valued attacker and this proces is repeated until no attacker is left. Then the score is calculated in a method like used in Crafty. As i said, this is a very clumsy and time consuming matter. It simply takes to much time to find these attackers. > >Severi
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.