Author: KarinsDad
Date: 07:10:43 06/17/99
Go up one level in this thread
On June 17, 1999 at 00:16:56, James Robertson wrote: >On June 17, 1999 at 00:10:11, James Robertson wrote: > >>I am trying to find the most efficient way to detect backward pawns, either with >>bitboards or the more conventional piece array. Any help is greatly >>appreciated!! >> >>James > >I suppose I could add to this. I decided that a backward pawn must be: > >On an open file, >Unable to be defended by another pawn, >unable to advance without capture by an enemy pawn (it may be able to advance, >but that wouldn't take it off the open file or defend it with another pawn). > >I cannot figure how to make this all work without tons of arrays and all sorts >of other nasty stuff. > >Help! >James Recommendation #1: Calculate square control for each square. This will also help you in other portions of your evaluation such as king safety. Recommendation #2: With square control, you do not need to calculate whether there is a protecting pawn on the adjacent file. Either the one (or two) squares in front of the pawn you are checking are controlled by white or by black. Recommendation #3: Set up a pawn structure hash table. Since pawns rarely move in the game (and in the search <40% on average), it is probably better to calculate pawn advantages and deficiencies once per given pawn structure as opposed to calculating it every time in your evaluation. Hope this helps, KarinsDad :)-
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.