Author: Russell Reagan
Date: 14:07:35 07/10/03
Go up one level in this thread
On July 10, 2003 at 05:01:48, Gerd Isenberg wrote:
>// int table[1 << 64] = {...}; // ?????????????
>int table[64]; // seems more reasonable
>
>int lsb(BitBoard singlebit)
>{
> // Create mask of ones based on least significant one in x.
> singlebit ^= (singlebit - 1);
> return table[(singlebit * magic) >> (64 - 6)];
>}
This sounds very interesting, but I don't really understand how this is supposed
to work. Does anyone have a working version (with an initialized table[] and
magic number, for instance)?
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.