Author: Tony Werten
Date: 00:55:21 12/04/01
Go up one level in this thread
On December 03, 2001 at 11:01:56, Ulrich Tuerke wrote: >On December 03, 2001 at 09:26:21, Gian-Carlo Pascutto wrote: > >>On December 03, 2001 at 09:19:16, Ulrich Tuerke wrote: >> >>>I don't agree fully with you, Gian-Carlo. >>> >>>I think that getting unreliable main variations is a well known consequence of >>>any zero window search like for instance PVS or MTD. >>>The reason is that you will very often have moves in the PV which are just >>>sufficient to refute the preceeding move. In general you wan't have exact scores >>>neither exact variations. >>> >>>I don't think that this effect has to be attributed to the hashing algorithm. >> >>In PVS, the mainvariation should _not_ have been searched with >>a zero window, and should hence be reliable. > >I think that you're right. My remarks apply to MTD only. It is actually the same reason why it's so difficult to get a good pv when using MTD. Tony >Uli >> >>-- >>GCP
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.