Skip to content

Commit

Permalink
Fix issue #1268
Browse files Browse the repository at this point in the history
If the search is quit before skill.pick_best is called,
skill.best_move might be MOVE_NONE.

Ensure skill.best is always assigned anyhow.

Also retire the tricky best_move() and let the underlying
semantic to be clear and explicit.

No functional change.
  • Loading branch information
vondele authored and mcostalba committed Oct 11, 2017
1 parent 43c186c commit 9d79138
Showing 1 changed file with 4 additions and 5 deletions.
9 changes: 4 additions & 5 deletions src/search.cpp
Expand Up @@ -87,10 +87,9 @@ namespace {

// Skill structure is used to implement strength limit
struct Skill {
Skill(int l) : level(l) {}
explicit Skill(int l) : level(l) {}
bool enabled() const { return level < 20; }
bool time_to_pick(Depth depth) const { return depth / ONE_PLY == 1 + level; }
Move best_move(size_t multiPV) { return best ? best : pick_best(multiPV); }
Move pick_best(size_t multiPV);

int level;
Expand Down Expand Up @@ -514,8 +513,8 @@ void Thread::search() {

// If skill level is enabled, swap best PV line with the sub-optimal one
if (skill.enabled())
std::swap(rootMoves[0], *std::find(rootMoves.begin(),
rootMoves.end(), skill.best_move(multiPV)));
std::swap(rootMoves[0], *std::find(rootMoves.begin(), rootMoves.end(),
skill.best ? skill.best : skill.pick_best(multiPV)));
}


Expand Down Expand Up @@ -1451,7 +1450,7 @@ namespace {
int push = ( weakness * int(topScore - rootMoves[i].score)
+ delta * (rng.rand<unsigned>() % weakness)) / 128;

if (rootMoves[i].score + push > maxScore)
if (rootMoves[i].score + push >= maxScore)
{
maxScore = rootMoves[i].score + push;
best = rootMoves[i].pv[0];
Expand Down

0 comments on commit 9d79138

Please sign in to comment.