v0.3.6

Bug Fixes

• Reinitialize selective depth on call to search
• Fix inverted calculation of least valuable attacker score
• Ensure quiescence nodes are never used for pv
• Don't overwrite exact hash table entries with non-exact evals
• Resolve hash collisions by comparing to original key

Miscellaneous Tasks

• Various minor lint fixes
• Stop including release candidate tags in changelog

Performance

• Calculate negative score when sorting instead of sort then reverse
• Modify move ordering score when destination is attacked
• Use depth in hash table replacement strategy

Refactor

• Clean up syntax used for bitboard mutations
• Implement Not operator for Color enum to simplify some match blocks

Testing

• Add test for hash key random uniqueness