Computer Chess Club Archives


Search

Terms

Messages

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

Author: Tord Romstad

Date: 02:48:40 12/02/03

Go up one level in this thread


On December 01, 2003 at 18:10:47, Mridul Muralidharan wrote:

>On December 01, 2003 at 15:31:46, Tord Romstad wrote:
>
>>On December 01, 2003 at 15:17:48, Mridul Muralidharan wrote:
>>
>>>Hi Tord,
>>>
>>>  Current messchess attack table implementation is based on what Vincent posted
>>>here some time back.
>>>  You could try using modifying the movegenerator that he presented here for
>>>attacktable generation - can be quiet fast :)
>>
>>Thanks for the suggestion.  I have considered giving Vincent's technique a
>>try, but unfortunately it suffers from the same problem (though not to the
>>same degree) as the somewhat simlar approach used in Gnuchess 4:  All these
>>lookup tables consume more space than I like, and I'm afraid I cannot afford
>>that ...
>>
>>Tord
>
>Since the same tables get used for move generation , attacktable generation ,
>mobility evaluation , etc - it would be quiet cache friendly ....
>Thats is what I currently do for mess anyway.

On a PC, it is certainly very cache friendly.  The problem is that I'm
afraid it would not work well on PalmOS units.

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.