Author: Edward Screven
Date: 13:50:19 06/18/98
Go up one level in this thread
my understanding of the crafty book building procedure is that you scan a pgn input file, streaming <position,win,loss,draw> records through an aggregating sort, and it's the disk sort runs that require lots of space. if this is correct, then a simple way to reduce your temporary space requirements by 1/N, at a cost of making N passes over the pgn input, is to partition the position keys into N equal sized ranges. make N passes over the input pgn file. on the i-th pass, discard all positions which are not in the i-th range. the independently sorted results of each pass can be appended to your final output file. - edward
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.