Author: Andrew Williams
Date: 03:43:06 08/27/99
Go up one level in this thread
On August 27, 1999 at 04:03:53, Scott Gasch wrote: > >Hi. > >I've implemented an opening book and now that it's done I have some questions ;) > >The book is stored on disk -- I hope to have it grow large enough one day that I >don't want to spend the memory on it. The problem is, though, that every book >probe is a disk hit. Therefore I don't want to do it too often in the search >tree. I am currently handling this by only probing book if the parent node was >in book too. The problem is, of course, that I don't get transpositions into >known book positions from unknown ones this way. Still, I think that >performance wise it is not a good idea to probe book for, say, all moves before >N in the game. What do others do with this? > >Or do you read the book into memory in the first place and not worry about these >problems. ;) > >Scott Hi Scott. I probe only at the root and then only if a book move was found in the last seven attempts. There's no particular reason for choosing seven. Andrew
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.