Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: SEE for forward pruning in Q. Search

Author: Scott Gasch

Date: 16:19:21 08/04/99

Go up one level in this thread


On August 04, 1999 at 16:32:10, Tom King wrote:

>Hi all,
>
>What are the pro's and con's of using a static exchange evaluator (SEE)
>for pruning captures in the Q. search? My program currently *doesn't*
[snip]

I just added a SEE call to both the q search and the regular move generator
(which sorts the move list before sending it back to my search routine).
Perviously I ordered the moves based on MVV/LVA.  I saw a 20% speed improvement
with the SEE.  Between the addition of the SEE and a bug fix (history table
values getting too large and messing up move ordering) the program is playing *a
lot* faster.

Scott



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.