Author: Bruce Moreland
Date: 19:22:23 07/28/01
Go up one level in this thread
On July 28, 2001 at 18:47:21, Ron Murawski wrote: > >I have implemented a pin bitboard for king-pinned >pieces and it has helped the strength of my program. I don't know anything about the rest of this, because I have never identified pinned pieces. How do you know that it helped the strength of your program? bruce >My question is: Is it worthwhile to identify ALL >pinned pieces? > >Whereas the king-pinned pieces were quite easy to >determine and very important to the scoring, any >queen-pinned, etc. pieces will take much longer to >calculate and have less effect. In fact, some of the >pins seem to be phantoms as they might disappear >because of possible checking moves, tactical threats, >etc. > >Is it better to discover these pinned pieces in the >search, or is it better to do all the additional >processing in the evaluator? Has anyone tried >implementing the detection of all pinned pieces and >was the time spent looking for these pieces worth the >effort? > >Thanks in advance, >Ron Murawski
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.