Computer Chess Club Archives




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

Author: Tord Romstad

Date: 07:47:03 01/15/04

Go up one level in this thread

On January 15, 2004 at 10:15:37, Matthias Gemuh wrote:

>Hi Tord,
>my approach is even more expensive than you think, as I am talking about
>attacked pieces, not just hanging ones.

You mean all pieces which can be captured, even if they are well defended?
That sounds truly wild, and makes me wonder how BigLion is even able to
complete a 3-ply search in less than a few minutes.  :-)

>I surprisingly get better results at test suites, than with "standard" QSearch.
>In games, I cannot notice any measurable difference.

Very remarkable.  I will try to experiment with a similarly huge QSearch myself
and see what I can find.


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.