Dev Builds » 20130613-1805

Use this dev build

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

Summary

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

Commit ID d54e8a59551a7ebcbf2c2155dce46c7386b1742a
Author Marco Costalba
Date 2013-06-13 18:05:02 UTC
Reduce more CUT nodes only if parent node is reduced So when we are doing a LMR search at the parent ALL node. This patch didn't prove stronger at 60" TC LLR: -2.97 (-2.94,2.94) Total: 22398 W: 4070 L: 4060 D: 14268 But, first, it scores at 50%, second (and most important for me) the opposite, i.e. normal reduction when parent node is not reduced, seems very bad: LLR: -2.95 (-2.94,2.94) Total: 7036 W: 1446 L: 1534 D: 4056 According to Don, this idea of increased reduction of CUT nodes works because if parent node is reduced, missing a cut-off due to reduced depth search (meaning position is somehow tricky) forces a full depth research at parent node, giving due insight in this set of sensible positions. IOW if we expect a node to fail-high at depth n, then we assume it should fail-high also at depth n-1, if this doesn't happen it means position is tricky enough to deserve a research at depth n+1. bench: 4687419
Copyright 2011–2024 Next Chess Move LLC