Author: Peter Kasinski
Date: 15:36:08 03/16/99
Go up one level in this thread
On March 16, 1999 at 16:58:09, Robert Hyatt wrote: >On March 16, 1999 at 12:04:51, Dann Corbit wrote: > >>On March 16, 1999 at 02:50:20, Cristian Zaslo wrote: >> >>>Hi everybody ! >>>Will anyone be so kind and briefly explain me what sort of >>>advantages would (not) have a chess programmer to implement >>>a SEE in his code. >>>Much obliged to you, >>>Cristian >>Er.... >>What's a SEE? I've been programming 33 years and I have never heard of one. > > >Stands for "Static Exchange Evaluator". It is a procedure that analyzes all >captures on a single square and returns a value indicating who comes out >ahead. > >It can be used to order captures so that you try QxP where the pawn is free, >before you try QxR where the R is defended. It can also be used to discard >some captures in the q-search such as QxR where the R is defended and you are >guaranteed to lose material. > >Used correctly it is possible to cut the size of the tree being searched by >50% or more. Bob, I looked at Swap() in Crafty where this is implemented. Not using bitmaps I don't have a cheap way to determine what pieces attack a given square. Would it still be profitable for me to compute these attacks in order to use SEE? thank you, PK
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.