Computer Chess Club Archives




Subject: Re: Natural move generation with bitboards (was Re:significant math)

Author: Alessandro Damiani

Date: 08:58:34 11/22/02

Go up one level in this thread

On November 22, 2002 at 11:37:56, Sune Fischer wrote:

>On November 22, 2002 at 07:42:51, Gerd Isenberg wrote:
>>For move generation, or if i really need disjoint attack sets, i currently favor
>>attack bitboards for a single sliding piece as well for a knight. That is what
>>my program does before with rotated bitboards and now with dumbfill and
>>Kogge-Stone mmx-routines.
>There is another thing which bothers we with disjoint attack boards, namely that
>they are _disjoint_.
>Some parallelism seem to be lost here, like how do you quickly detect a knight
>attacking a certain square if your knight attack boards are split into 8?

Those 8 knight attack bitboards are only used for move generation. Each time a
move has been searched the to-square is removed from such a bitboard.

To do what you say the flood-fill attack detection functions are used.


This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.