Author: Zach Wegner
Date: 08:09:10 12/04/03
Go up one level in this thread
On December 04, 2003 at 10:34:35, Maurizio Di Vitto wrote: >I'd like to thanks mr Wegner for the last explanation, it was very clear. I have >another question. I have just initialized rank_attack[64][256], I red all your >instruction and I found that solution very interesting, I did the same for >file_attack[64][256], I mean that I used an int rotated_bitboard906[64] that >represent the rotated bitboard, so I declared a bitboard called temp[64][256] to >memorize all the situation about a file, but I see that like a rank, so what I'd >like to know is how I can memorize that bitboards to file_attack[64][256], I am >not sure that this is the right way, but i think file_attack[64][256] should >represent the file state just as files and not as ranks. >Thanks a lot again. >Maurizio Di Vitto I'm not sure exactly what you are asking, but it seems you do not have a rotated bitboard representing the occupied squares. Keep this along with your normal bitboards, and update incrementally with mask[rotateL90[x]] rather than mask[x]. It is the same as the occupied, but being rotated allows you to know the state of a file in 8 adjacent bits. Then it is used just as if it is the rank_attacks array, but it is initialized by shifting the bits up and down instead of left and right. Regards, Zach
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.