Author: Odd Gunnar Malin
Date: 15:55:33 12/25/03
Go up one level in this thread
On December 25, 2003 at 16:51:07, F. Huber wrote: >Hello Odd Gunnar, > >I´ve a question about your little tool ´PgnSplit´ (Btw, a really very >powerful utility!): > >I tried to convert a rather large (about 3MB) and deeply nested PGN, which >I created from the Rebel12 book, but it seem that this size is too large >for PgnSplit!? > >It took more than half an hour (on my slow notebook), blowed up my paging >file from 128 to more than 350MB (with 128MB RAM installed) - >and then CRASHED! :-( >(Something like "Windows Application Error ...") > >Is there any limit in the size or in the ´recursion´ (how deep nested) >in your PgnSplit? > >Regards, >Franz. It is writen very simple with recursion for variants. Each game are keept inside the memory eg. read one game, write one game, read next game etc. There is no limits for number of variations, each position have a vector<chessmoves> moves so other than the limitation of memory there shouldn't be any. I don't have too fast PC here but will start it with DevPartner (BoundsChecker) on a big file to see if I catch something. This is very slow so if it took you half an hour in release mode it could take days in BoundsChecker mode. There is also an option to do a rewrite to get it faster. I wrote it with putting together other functions/classes I allready had written and especially the positionclass is big. Odd Gunnar
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.