Author: Inmann Werner
Date: 08:48:50 02/23/00
Go up one level in this thread
On February 22, 2000 at 13:27:27, José Carlos wrote: <snip> > My idea is that _apart_ from the usual way of handling the opening book, store >the book moves in the hash table. My english is not very good and I'm not sure >if I explained it correctly. :) > > Thanks anyway for your valuable opinion. > > José C. I see (IMHO) no success in storing the book moves in hash table. If a position occurs, where there is a book move, it gets played. So in search, you never can reach a "book position" (correct?) Second, you have no clue, which evaluation value you should give the book move. So it would disturb your search, if you would come to such a position (which IMHO does not happen) Third, your book (after some years, and after implementing learning) can get really huge, and will not fit in RAM or hashtables. But that is only my opinion.... 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.