Computer Chess Club Archives


Search

Terms

Messages

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

Author: Matthias Gemuh

Date: 14:45:56 01/14/04

Go up one level in this thread


On January 14, 2004 at 16:12:08, Tord Romstad wrote:

>On January 14, 2004 at 15:44:56, Matthias Gemuh wrote:
>
>>Does it make sense to use PVS algorithm to implement QSearch ?
>>It does not seem to help my engine.
>
>I have very little experience with PVS, but intuitively I would guess that it
>doesn't make much difference in the QSearch.  The QSearch is not very deep, and
>at most nodes you will have a zero-width window already when you enter the
>QSearch.
>
>Have you considered trying MTD(f) instead of PVS?  I am not sure it is any more
>efficient in practice, but it is easier to code, and has the additional benefit
>of making you feel different, original, interesting, intelligent, handsome and
>attractive.
>
>:-)
>
>Tord



Though my implementation of PVS() is so bad that any other algo would
by definition be better, I think MTD(f) would be worse :).

/Matthias.









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.