Alexander Wagner a écrit : > > So we could use a PGN-ified version of Scid.eco or > > something like that and asks Scid to generate the cache > > from it (even if the computing time will increase > > somewhat). > > This is a good starting point, still I think it would be > woth to have also a "userdefined input file" somewhere which > could be used as input to add lines to the cache. IMHO the > sor-files are in a way the natural source. One could also > use some pgn of course and have a function like "fill cache > with lines from pgn". > > > I will look at it. > > TIA :) > 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 (!). 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 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.
Pascal ------------------------------------------------------------------------- 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
