Author: José Carlos
Date: 08:53:13 02/21/00
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.
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.