MinimalChess is a simple UCI chess engine written in C#.
Version 0.6 uses an improved transposition table with two buckets and aging. It also adds late move reductions and deep futility pruning. Quiet moves are now sorted based on a simple history heuristic which has a nice synergy with LMR. The PST based evaluation is updated incrementally.
In total these changes allow MinimalChess to search much deeper (at the cost of accuracy) so that it gains about 200 ELO in playing strength over the previous version. The removal of the triangular PV table and other simplifications mean that the size of the codebase is about equal to the previous version. This makes this version not only the strongest but also the one with best strength/LOC ratio.