Author: Tord Romstad
Date: 13:12:08 01/14/04
Go up one level in this thread
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
This page took 0.01 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.