Author: Ralf Elvsén
Date: 16:42:07 04/04/01
Go up one level in this thread
On April 04, 2001 at 17:51:28, Dan Newman wrote:
>On April 04, 2001 at 12:01:45, Ralf Elvsén wrote:
>
>>On April 04, 2001 at 10:43:42, Vincent Diepeveen wrote:
>>
>>>
>>>Oh well programs i suspect they do not use bitboards (if they do i
>>>would be honored if programmer says so):
>>> DIEP
>>> Ferret
>>[snip]
>>
>>I have a disctinct memory I have seen a post from Bruce where
>>he posted code ala
>>
>>if (bishops & white){...
>>
>>and I got the impression that it was from Ferret. I can be mistaken
>>of course.
>>
>>Ralf
>
>I've gotten the impression (from Bruce's posts) that Ferret is not a
>bitboard program but that he does use some bitmaps here and there.
>
>I also got the idea that he generates moves more in the fashion of the
>old Gnuchess where you lookup the next move from a large pre-generated
>data structure. That may not be exactly correct, but he did say that
>his moves are in the form of pointers into a large chunk of pre-generated
>data (like hashcode deltas and so forth) that can be used to speed up
>make() and undo()...
>
>-Dan.
You are right. I found the post in a corner of my harddisc. Actually
it was part of an excellent explantion of 0x88 by Bruce :)
Ralf
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.