Raphael is a hobby project that is still a work in progress, but it will be updated as time goes by. It is nowhere near as competitive as some of the other chess engines out there, but it is strong enough to beat most humans with ease.
Author: Rei Meguro
Raphael 3.0.0 - what's new?
Non-functional changes
uci now supports MoveOverhead option
past time and increment is now properly cleared on every go command
multiple go settings (e.g., depth, nodes) can be combined, and the first limit hit would stop search
changed how nodes are counted (nps may seem lower now)
v3.0
implemented custom legal move generator
implemented staged movegen/picker (with SIMD friendly sorting)
implemented hard/soft time management
fixed bug where NNUE eval was being called in check
fixed bug where qsearch fp and see pruning was sometimes pruning all moves
fixed bug where tt bestmove was being set even if alpha wasn't raised
halved tt entry size by packing keys and switched to uint128 for faster indexing
implemented tt aging
implemented qsearch tt cutoff
implemented qsearch and nmp tt prefetching
implemented aspiration widening
implemented move score-based good/bag noisy splitting
implemented internal iterative reduction
implemented singular extensions
implemented double extensions
implemented negative extensions
removed one reply extensions
removed check extensions
Performance
+227 STC against v2.3 (3321 estimated CCRL blitz)
+197 LTC against v2.3 (3236 estimated CCRL 40/15)
Bench: 13240630
Comments
Post a Comment