Author: Gerd Isenberg
Date: 14:09:22 01/16/04
Go up one level in this thread
On January 16, 2004 at 16:06:22, Alessandro Damiani wrote: >>> >>But with bitboard declaration instead of BYTE[8] (what about a union?). >>The only trick is to pack the 15 diagonals byte aligned into eight bytes and >>address them in this manner. >> >>rightupIdx = (sq-Rank(sq)) & 7; >>rightDownIdx = (~sq-Rank(sq)) & 7; >> >>My drawback was the byte access with zero extending to 32-bit. >>Your drawback is to update four SlideIndices additionally to the none rotated >>one and i had only three additional ones. >> > >Which additional non rotated one do you mean? > I see, you don't need the none rotated occupied one anymore. Ok, if you have black and white occupied you may easily get it. >Alessandro
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.