Author: JW de Kort
Date: 12:04:16 05/18/03
Go up one level in this thread
On May 18, 2003 at 10:54:57, Uri Blass wrote: >On May 18, 2003 at 09:52:43, JW de Kort wrote: > >>Dear friends, >> >>For a long time i have been planning to use attack information in my 0x88 based >>program. Before evaluation starts, my program calculates a table with attack >>information like the one discribed on the internet page of Ed Schroder. The >>result is disaterous: nps count has dropped by 50%! I have taken a look at the >>Sjeng code but as i see it, this must also be a serious reduction of the NPS in >>this program. >> >>Can anybody give me some tips to do this efficiently? > >Does your program search less nodes per second than shredder7.04? >I think that if it does not do it then you have nothing to worry about. > >Can you tell us how many nodes per second your program search and what is the >hardware that you use? > >drop of 50% in the nps does not have to be bad. >I think that the advantage of attack table is bigger than it. > >Uri Dear Uri, Thank you for your reply. To answer your questions: I have no idea how many nodes Schredder searches but even if mine would be faster i doubt if i would benefit from this. Currently i search about 160.000 nps but i think the program does not count correctly making it even slower. I use a 600mhz pentium III and abou 192MB. Can you give me some advantages i could achieve? I can only think of some advantages when evaluation kingsafety and attacked pieces. But i think ther are more. This table is generated at the start of evaluation because updating it after every move would cost to much time.
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.