Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Generating attack tables: Is this code good?

Author: Tord Romstad

Date: 05:25:18 12/01/03

Go up one level in this thread


On December 01, 2003 at 07:36:11, martin fierz wrote:

>On December 01, 2003 at 06:57:13, Tord Romstad wrote:
>
>>From the initial position, I compute the attack tables about a million
>>times per second with this code.  From WAC1, the rate drops to about
>>700,000 times per second.  The high nodes/second count of Rebel (which
>>has similar tables) makes me believe that it is possible to do this
>>many times faster.
>
>hi tord,
>
>what hardware would that be? your P4 2.4GHz as usual?

Yes, I'm sorry I forgot to mention it.

>so i don't have an answer to your code, but i'm also wondering how the other
>engines manage to be so fast. don't they generate attacks? or is there a smart
>way to update attacks incrementally? or are their authors just so much better at
>programming?

At least in the case of Rebel, I know that the tables are not updated
incrementally.  Ed generates the tables from scratch at every node,
and still achieves a remarkably high nps count.

Tord



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.