Author: J. Wesley Cleveland
Date: 11:50:21 06/17/99
Go up one level in this thread
On June 17, 1999 at 13:26:14, Chuck wrote: >I agree in with KarinsDad's approach to this as probably best in the long-term, >to really handle this correctly you need to know whether the backward state is >a potential problem. However, if you want to just implement it now, you could >simply create an array of 8 int's and store the rank on which each pawn resides. >Then for each element, you check the adjacent array elements to see if the >rank value is higher. If it is in both cases, then you have a backward pawn, and >from there you could investigate the amount of actual "backwardness". In >particular though, I think the idea of hashing the pawn structures is one of >the best. > Crafty, e.g., generally gets better than 99% hash hits on its pawn hash, so you can afford to do a lot of work if you can save it in the hash table. One idea is to store two arrays of bits, one for each pawn that is backward, and one for each pawn that may be backward depending on piece position.
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.