Reduce initial sampling rate
Reduce overhead for processing completions in high branching factor games
Avoid repeated recalculation of goal ranges in games with no detected latches
Added logging of pseudo-puzzle detection
#154 Don't save & reload GDL for massive games
Finish 2014 Candidates
Handle factorized games where one search tree turns out to actually be irrelevnt to our score
Increment version number
#157 Add local (fixed) copy of stanford.arithmetic, for testing
#158 added logging so that we can quickly see bad GDL in cases like TicTicToe shoudld they arise in competition
Updated version to 1.60 prior to competition
Configure logging even when running from command-line jobs
Check score (if desired) at the end of a test
Regression case for all the published Stanford puzzles
Copy of unpublished games
Game characteristics
Game characteristics
#158 Upgraded info log to warning
#159 Fix negative simulation rate
Game characteristics