Author: Rafael Andrist
Date: 03:02:33 10/19/00
Go up one level in this thread
On October 19, 2000 at 05:36:14, Tony Werten wrote: >On October 19, 2000 at 03:12:43, Rafael Andrist wrote: > >>I'm actually writing a little chess program and want to detect pinned pieces in >>the evaluation function because i do calculations, how often a piece is attacked >>and "defended". If it's now attacked by 3 and defended by 3, but one of them is >>pinned, the search needs 5 or 6 ply to detect the pinned piece. Has someone an >>idea how to solve this problem in eval or is it only possible in search? > >After the normal search, you do a quiscence search, ie only capturing moves (and >the abbility to stop and accept the current score). This search takes care of >your problem, since the pinned piece will not recapture. > >Tony I know how this problem is solved in search. But my question was, if it is possible to do this in the position evaluation.
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.