pgeorges schrieb: Hi!
> I tried to extend the number of lines used to fill the tree cache (2000 > lines from ECO classification). Then I ran it with a tree from a 3 M > games base : the cache would need several weeks to be filled (!). 3M means 3*10^6 I guess or 3.000.000 games. It would make me wonder if you could fill the cache in much less that that time. IMHO that's the point why one would need some user defined level as you can't fill every line into the cache. Additonally at some point I feel you'd not gain from the cache anymore as searching the cache would need the same time than searching the db. > So I removed this, and added extra menus to fill the cache > corresponding to an opening base (with a few games, each > less than 100 moves). This sounds more resonable. But just to get it correctly. What you call an opening base means essentially a scid-db that contains just games for the openings one is interested in. The simplest idea to build such a DB would be to select all games for A00, and then cut the games to say 25 moves. Right? (Of course one would invest a bit more work into the creation of such a DB.) The result might be called A00DB. > This opening base contains my own book and the cache is > filled by walking through all moves and variations. The > timing is more reasonable (around one hour for each game). > Once done, the tree works instantly. That is now I open the 3M DB you mentioned in the first hand and say something like "fill the cache with the input from A00DB"? It will then search every position found in A00DB in 3M DB and add the games found to the cache. I guess if the games found by this procedure drops below a certain number (say 10 or 50, I do not know when direct searching gets as fast as cache searching) it does not follow the input tree any longer but moves on to the next game in A00DB. -- Kind regards, Alexander Wagner Universitaetsbibliothek Ilmenau Langewiesener Str. 37 98693 Ilmenau Tel.: 03677/69-4521 , Fax.: 03677/69-4617 ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2005. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Scid-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scid-users
