Author: David Rasmussen
Date: 11:37:41 11/28/02
Go up one level in this thread
On November 28, 2002 at 14:10:33, Sune Fischer wrote: > >Yes, bisection is fast, so you then store the keys in ascending order? >I guess it doesn't work if you just put things in there by random. > Yes, the entries are sorted, of course. This makes it harder (but not impossible) to add new entries. I haven't written code to do this, though. Whenever I wanted something added, I just add the pgns in question to the pgn I used before, and build the book anew... :) Not a problem so far, for me. >I am beginning to like this format I think :) > It can be improved immensely, but it's simple and it works. /David
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.