Author: Robert Hyatt
Date: 15:36:17 02/01/01
Go up one level in this thread
On February 01, 2001 at 14:19:25, Alvaro Jose Povoa Cardoso wrote: >Does any one tried to use just Upperbounds and Lowerbounds in hashing, ignoring >ExactScore entries? >My question has to do with the fact that if we use ExactScores we don´t get long >PVs to feed in the next iteration, even if we extend PVs from hash. >My testing shows that if we do not use ExactScore entries in the hash table, we >end up with very long PVs that can be fed into the next iteration in order to >aproximate the minimal tree. After all, ExactScores are rare compared to >Upperbounds and Lowerbounds. > >Can someone comment on this? > >Thank you >Alvaro Cardoso Test it. IE I suspect that in middlegame positions, assuming you use PVS, it might be perfectly ok. But then how about in endgame positions like fine 70? Your assignment, then, is to do this experiment and report the results back in class as soon as possible. :)
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.