Author: Inmann Werner
Date: 04:18:09 02/22/00
Go up one level in this thread
On February 21, 2000 at 11:53:13, José Carlos wrote: > I don't know how most people do this, but I load the opening book into the >hash table. That way, when the program is out of book it still can try to reach >known positions, and searchs much faster. > What I'm not sure is about the evaluation I should assess to those positions. >Right now I use a zero eval, but probably it could be interesting to assess a >small avantage to the program in those positions, cause they are good enough to >be played without thinking if they can be reached in one move. > Anyway, the value could not be very high, to avoid the program to miss a more >favourable continuation after a mistake of the opponent. > > Have any of you experienced with this idea?. What do you think about it? > > José C. I do not store opening book in RAM. I always look at the harddisk. I do this only once at the beginning of the search and only, if one of the last three trys gave a hit. Otherwise a set a flag "out of book" If I find an interesting book move, i play it. Better would be a small (4 ply?) search, to get a move for pondering, and then play the opening book move and change to ponder. I do not like the idea, to stuff the opening book into the hashtable. Hashtable place is to much worth for me, and book moves have no "real" score. It would mix up a lot. Open book moves have no eval in my prog (only a value for searching an interesting opening move, and a flag (! !! ? ?? =) Werner
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.