Computer Chess Club Archives




Subject: Re: QSearch() as PVS() ?

Author: Tord Romstad

Date: 09:29:31 01/15/04

Go up one level in this thread

On January 15, 2004 at 10:50:53, Anthony Cozzie wrote:

>On January 15, 2004 at 07:48:42, Matthias Gemuh wrote:
>>BTW, in QSearch I also generate moves for
>>1) all passed pawns
>>2) all attacked pieces moving to unattacked empty squares
>OK, this seems very strange to me.
>If your eval is < alpha, how is moving an attacked piece going to increase it?
>The only way this makes sense is to never stand pat in q search.  Tord's idea
>_sort of_ makes sense (I have seen similar horizon problems in Zappa)

I'm not sure it would be a good idea in Zappa, really.  I think such
techniques are mainly useful in slow engines like BigLion and Gothmog.
In my own testing, I have noticed that it seems to be most effective at
extremely fast time controls (I often test at 15 seconds/game).


This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.