Author: Will Singleton
Date: 09:39:48 05/16/04
Go up one level in this thread
On May 16, 2004 at 08:30:48, Uri Blass wrote: >Suppose that you have a book of 2^20 positions. >Suppose that you need in average 16 bytes for every position(to store >positions,moves and some more information like learning value for every move). > >I do not like the idea to store only positions in book and I think that the the >job of making all moves in book positions to find more book moves can be done in >the time of creating the book. > >I can think of 3 ways to find if a position is in book > >1)To do a binary search in the file that has the positions(Disadvantage:you do >more searches in the file relative to other ways and you basically need to probe >the file 20 times only to find if a position is in book). That's what I do. Easy and quick.
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.