Running freecell-solver-range-parallel-solve.exe on Windows 2000 and
Windows NT. The exe was built with MSVC v6.
I'm running thru many Freecell game numbers and occasionally hitting
game numbers that use large amounts of memory. In the NT and Win2k
Task Manager a small number of games take a long time (a minute or 2)
to be solved. the Mem Usage column gets up to about 230 Megs on some
game numbers but the VM Size gets up to 1.2 Gigs and more. I have to
cancel out of a few of the worst of them because the swap disk doesn't
go higher than 1.4 gigs.
I think a lot of memory fragmentation is going on. I'd like to
understand why this happens. Is memory allocated on one long deep
stack? Is the Freecell algorithm deeply recursive?
I'm also wondering what the INDIRECT_STACK_STATES versus
COMPACT_STATES flags do.
Also, do you happen to know how from the Microsoft NMake command to
pass a definition of either of those flags down to the compiler?
Received on Wed Apr 21 2004 - 21:26:49 IDT