Author: Jan K.
Date: 05:54:41 08/26/04
Go up one level in this thread
>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. Yes of course. >One bitboard only can't say if it's an isolated or backward pawn and that eats space from the >pawn hash. Yes of course. >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. > I do the same.... You are not giving answers to my problem, which is: when evaluating if the square is strong for white, in pawn evaluation you take many factors into consideration:for example 1)can opponent drive knight out of this square with his pawns? 2)is it blocking weak pawn? 3)is the square on an open file? and so on....however during pawn evaluation I have some temporary structures like WhichIsTheMostForwardPawnRankOnThisFile[10],WhichIsTheMostBackwardPawnRankOnThisFile[10] and these I do not store(and I don't want to) into hash table...what I store into hash table are bit masks like you do(1 bit for each file)....now the problem:how to store the information about strong squares using something effective and elegant as bit masks? Because what sucks is that when I probe hash table I get only info thats stored there and not big temporary structures like WhichIsTheMostForwardPawnRankOnThisFileWhite/Black[10],WhichIsTheMostBackwardPawnRankOnThisFileWhite/Black[10] and without them I cannot evaluate if the square is strong or not( 1) is the problem here).
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.