Author: Peter Fendrich
Date: 04:08:56 08/26/04
Go up one level in this thread
On August 26, 2004 at 06:51:00, Jan K. wrote: >Hi,in non-bitboard evaluation what structures do you use to keep info of strong >squares for knights and how do you generate such information? Everything that I >can think of right now has disadvantages:too big pawn hash structure,hard to >manage array,.....thx. I suppose that this is the same thing for bitboarderss and non-bitborders. I don't keep that information updated and have to recompute it every time. 1) Extensive code for evaluating each pawn and keep the data in pawn hash. Among other things isolated, backward and passed pawns. 2) In the evaluate function, use the pawn-hash or newly computed pawn info. Good places fo the knight is in front of isolated and backward pawns and in some cases in front of passed pawns. /Peter
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.