Author: Uri Blass
Date: 18:20:50 09/16/04
What is faster doing a loop on the 1's of a bitboard or doing a loop on array of integers I simply consider to change my knight move generator to bitboards Today I have array int knightmove[64][8] and the question is if getting knightmove[c3][0],...knightmove[c3][7] is faster or slower than getting the same squares by calculating the 1's of knightoption[c3] in order to get the squares that the knight can go. I also consider to have bitboard knightcapturewhite[64] knightcaptureblack[64] and knightquietmoves[64] that are going to be updated incrementally after every move and the question is what is the price of this in speed. Do people who use bitboards have experience with it? Uri
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.