Dev Builds » 20170504-0246

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.

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 8b15961349e18a9ba113973c53f53913d0cd0fad
Author joergoster
Date 2017-05-04 02:46:40 UTC
Fix multiPV issue #502 In general, this patch handles the cases where we don't have a valid score for each PV line in a multiPV search. This can happen if the search has been stopped in an unfortunate moment while still in the aspiration loop. The patch consists of two parts. Part 1: The new PVIdx was already part of the k-best pv's in the last iteration, and we therefore have a valid pv and score to output from the last iteration. This is taken care of with: bool updated = (i <= PVIdx && rootMoves[i].score != -VALUE_INFINITE); Case 2: The new PVIdx was NOT part of the k-best pv's in the last iteration, and we have no valid pv and score to output. Not from the current nor from the previous iteration. To avoid this, we are now also considering the previous score when sorting, so that the PV lines with no actual but with a valid previous score are pushed up again, and the previous score can be displayed. bool operator<(const RootMove& m) const { return m.score != score ? m.score < score : m.previousScore < previousScore; } // Descending sort I also added an assertion in UCI::value() to possibly catch similar issues earlier. No functional change. Closes #502 Closes #1074
Copyright 2011–2024 Next Chess Move LLC