Author: Peter Fendrich
Date: 05:20:03 08/26/04
Go up one level in this thread
On August 26, 2004 at 07:48:57, Jan K. wrote: >With bitboards you can store the info in much more elegant way it seems, of >course the outcome is the same :) i don't have a problem with "what-to-evaluate" >but "how-to-store-it"....ie with bitboards in pawn evaluation you can exactly >say "this is a strong square" and then put the info into one 64-bit integer for >both sides, without it you have to use multiple arrays unless you find something >clever. ;) What I meant was that the information isn't part of the bitboard infrastrucure that is continously updated and it has to be computed all the time. One bitboard only can't say if it's an isolated or backward pawn and that eats space from the pawn hash. For space reasons, I store one 8-bit mask for backward pawns, one for isolated etc in the pawn hash. One bit per file. You can do the same even if the program isn't a bitboarder. The cost to consider, bitboards or not, is the usage of this information... /Peter
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.