Author: Tord Romstad
Date: 03:23:06 05/19/05
Go up one level in this thread
On May 19, 2005 at 04:05:02, Matthias Gemuh wrote: >It is so expensive to back up final eval position to root that no program does >it. At most a program may follow its PV to track down this position but hash >tables prevent full PV. And even if full PV of main search is available, that >of QSearch may not be available. >Of course the feature you want can (at a cost) be implemented, but not in a >competitive engine. If I understand the question correctly, it is possible, and the cost is rather small. In a PVS search, you can simply decide not to allow any hash table cutoffs at PV nodes. I do this in Glaurung, and it seems to work well. Tord
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.