Byte-knight - UCI chess engine
Author: Paul T (USA)
3.0.0
This new release of byte-knight focuses on search improvements and bug fixes. Overall, there is a ~200 elo gain over v2.0.0.
Search
Implemented late move reductions
Implemented internal iterative reductions
Implemented null move pruning
Other changes and fixes
byte-knight now outputs the correct principle variation during search instead of just a best move
Added transposition table probing and storing in qsearch.
Updated search bench FEN suite
Small code refactoring to make code more ergonomic
More mate in X tests
Fixed bug when negative times are given with go wtime/btime commend
Fixed bug with history bonus/malus calculation in certain situations
Added way to track node types during search
Increased base search bench depth to 8
Comparison to v2.0.0
STC
Elo | 197.30 +- 7.95 (95%)
Conf | 8.0+0.08s Threads=1 Hash=16MB
Games | N: 5000 W: 2855 L: 286 D: 1859
Penta | [6, 104, 519, 1057, 814]
https://pyronomy.pythonanywhere.com/test/2755/
LTC
Elo | 200.24 +- 10.84 (95%)
Conf | 40.0+0.40s Threads=1 Hash=128MB
Games | N: 2500 W: 1421 L: 121 D: 958
Penta | [0, 37, 272, 545, 396]
https://pyronomy.pythonanywhere.com/test/2756/
Comments
Post a Comment