Author: Alessandro Damiani
Date: 04:27:58 08/04/02
Go up one level in this thread
> >So basically what I'm doing now is trying to determine which ones I need and >which ones are overkill. Maybe you can tell me how I'm doing. For example, I >don't think you need an "all pieces" bitboard, since you can compute it via >(whitePieces | blackPieces) which is a single OR operation (well, more on >32-bit, but...). That is cheap compared to the cost of keeping up with an "all >pieces" bitboard and incrementally updating that one at every node just to avoid >the single OR operation. So that makes me think "all pieces" is overkill. Is >that right or not? Then again, there is the need to use "all pieces" to compute >the rank/file/diagonal states. Hmm...help? I need "all pieces" in static evaluation. Since static evaluation is done in every node I need "all pieces" anyway. 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.