Computer Chess Club Archives


Search

Terms

Messages

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

Author: Daniel Clausen

Date: 03:55:11 11/21/02

Go up one level in this thread


On November 21, 2002 at 06:47:24, Steffan Westcott wrote:

>On November 21, 2002 at 05:55:59, Alessandro Damiani wrote:
>
>>And for sliding pieces? The distance between the from- and the to-square is not
>>fixed. In the worst case, for each to-square there are 7 from-squares for one
>>direction. Do you keep one bitboard for each distance in one direction, ordered
>>from 1 to 7? Just my first thought.
>
>No, just one bitboard is used to store all possible destination squares for,
>say, upward rook moves. Look for my example routines FillUpOccluded(),
>FillRightOccluded(), etc in the CCC archives (when they get updated, eventually
>:-< ) for a suggestion on how to calculate this type of bitboard quickly.

_Very_ interesting ideas, Steffan! I can't say I understood everything yet, but
weekend is coming soon, so.. :) Thanks for sharing them!

Sargon



This page took 0.03 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.