Dev Builds » 20180817-0940

Use this dev build

NCM plays each Stockfish dev build 20,000 times against Stockfish 14. This yields an approximate Elo difference and establishes confidence in the strength of the dev builds.


Host Duration Avg Base NPS Games WLD Standard Elo Ptnml(0-2) Gamepair Elo

Test Detail

ID Host Base NPS Games WLD Standard Elo Ptnml(0-2) Gamepair Elo CLI PGN


Commit ID 96c3a1f2eca1dfb96fdddc03630e6d984c358a2b
Author VoyagerOne
Date 2018-08-17 09:40:29 UTC
Mix search stats with evaluation Mix search stats with evaluation: if the opponent's move has a good historyStat, then decrease the evaluation of the internal node a bit for the pruning decisions during search. STC; LLR: 2.96 (-2.94,2.94) [0.00,5.00] Total: 72083 W: 15683 L: 15203 D: 41197 LTC: LLR: 2.95 (-2.94,2.94) [0.00,5.00] Total: 29104 W: 4867 L: 4630 D: 19607 Closes Bench: 4514101 ----------- How to continue from there? • the use of the previous stat score can probably be simplified in lines 587 and 716 • we could try to use a continuous bonus based on the previous stat score, instead of just a fixed offset of -10 when the opponent previous move was good. ---------- Comments by Stefan Geschwentner: Interesting idea. Because only the eval in search is tweak this should only influence the eval and static eval used at inner nodes, and not on the return search value (which comes in the end from quiescence search), except through saving in TT followed by a TT cutoff. So essentialy this effects diverse pruning/reduction parts -- eval and static eval are lowered for good opponent moves: • tt cutoff (ttValue) • improving (static eval) • more razoring (eval) • less futility pruning (eval) • less null move pruning (eval + static eval) (but with little more depth) • more probcut (static eval) • more move futility pruning (static eval)
Copyright 2011–2024 Next Chess Move LLC