Author: Uri Blass
Date: 22:32:52 07/24/02
Go up one level in this thread
On July 24, 2002 at 21:54:12, Robert Hyatt wrote: >On July 24, 2002 at 13:13:11, Gian-Carlo Pascutto wrote: > >>On July 23, 2002 at 12:08:43, Uri Blass wrote: >> >>>I still do not use hash tables to save generating moves and it is another gain >>>that I can get from hash tables. >> >>That gain is very small - I still don't do it either. >> >>-- >>GCP > > >I think for me it was about 10%. Not huge. Not ignorable either. if you >count the number of times the hash move causes a fail high, that is the number >of move generations you will totally avoid... It may or may not be a lot >depending on other factors... No It is not the number of move generations to avoid for me. You should multiply it by the number of legal moves because I generate them before looking at the hash tables. I still did not change it and in the last days there are other simple changes that I tested. Every change may do the program only slightly better and I prefer to test after every small change in the search rules in order to avoid bugs(there were cases when a change that I knew that it should be productive was not profuctive because of a bug). Every test takes time because I use the GCP test suite at 5 minutes per position so the test takes 15 hours. I may also try the quick test suite because I remember that I read that there is no problem of finding the right move for the wrong reason in that test. Uri
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.