- A more aggressive use of heuristics to organize SEE moves (including for quiet passages); - Turns the generator converted into a magic bitboards; - Various improvements mechanisms to reduce the depth of enumeration; - Adaptive trust the search box (on the basis of the depth and evaluation); - New scheme of priorities while maintaining the moves in the hash table (based on the best move of the index); - Various optimizations; - Further adjustment of the evaluation function.