Author: Uri Blass
Date: 00:35:49 09/19/04
Go up one level in this thread
On September 19, 2004 at 01:25:41, Stuart Cracraft wrote: >On September 16, 2004 at 21:20:50, Uri Blass wrote: > >>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 > >Don't do it all at once. > >First convert your evaluation to use it. Make a hybrid. > >Then when you have a 64-bit machine you have more motivation to do the work >to go from hybrid to whole. > >Stuart I think that Athlon64 is a 64 bit machine so I already have a 64 bit machine. I already use bitboard for pawn structure evaluation so I can say that I already use hybrid. Uri
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.