Individual results are now placed in a result set indexed on number of cards in play and number of bingos available
Now simulating between 1 and 400 available bingos, with between 1 and 800 cards. Unfortunately, performance is slow and memory use is high
Introduced a thread pool to take advantage of all cores of my cpu. Memory use is still a concern
Attempted to improve memory footprint by eliminating per-game results from result set. Instead, we store only mean and standard deviation
Cut memory use significantly by paging lines of data out to disk as soon as computation is complete
Removed unused standard deviation calculation from bingo result set
Removed result set object allocations. This should reduce memory footprint and speed things up somewhat