Repeating --
For some reason the mailing list is stripping my reply, so I will one
more time.
There is also the command line utility pgnscid which converts a pgn
file to a scid database.
You can then open that in scid and append it to your main database or
just place a filtered subset
of Pe
>>Peter Horst a écrit :
>>I want to import a large number (~100) of individual pgn files into a
>>Scid database. I'm under the impression that I can only import 4 at a
>>time. Is this correct? If not, what is the correct procedure? Worse
>>comes to worst, I can always stitch the pgn files togethe
Peter Horst a écrit :
I want to import a large number (~100) of individual pgn files into a
Scid database. I'm under the impression that I can only import 4 at a
time. Is this correct? If not, what is the correct procedure? Worse
comes to worst, I can always stitch the pgn files together with a
We all know RAM is cheap nowadays.
I made some tries with Scid and here is the memory footprint I got :
Scid empty : 26 MB
+ -> with a base of 1.5 M games loaded : 128 MB
+ -> with 1 M games in clipboard : 359 MB
So I think the clipboard can handle 1 M games without problems. If an user get
Lew Worthington a écrit :
> Pascal,
>
> This is an improvement. Thanks.
>
> With memory quite plentiful, I frequently work with a database of a
> couple
> million games. It would be nice to load all Sicilians, for example, into
> there. It's not a huge deal, but it would be nice.
> Is there a way
Hi,
Some users asked for an increase of the maximum number of games that the
clipboard base can handle (remember this base is only in memory). So I
set this max to 100.000 : the memory footprint of this base will be at
most 20 MB, which will not be a problem on most computers.
I personaly don't
When I export a game as latex with diagrams (comments with '#'), pdflatex
creates diagrams with a white bar on the extreme right, inside the diagram
frame. Is there anyone who knows how to fix this problem? The workaround is
dvi->ps then convert from gsview, so it's not a huge problem.
Daniel Jac
