// Different node types, used as template parameter
enum NodeType { Root, PV, NonPV };
- // Dynamic razoring margin based on depth
+ // Razoring and futility margin based on depth
inline Value razor_margin(Depth d) { return Value(512 + 32 * d); }
+ inline Value futility_margin(Depth d) { return Value(200 * d); }
- // Futility lookup tables (initialized at startup) and their access functions
- int FutilityMoveCounts[2][16]; // [improving][depth]
+ // Futility and reductions lookup tables, initialized at startup
+ int FutilityMoveCounts[2][16]; // [improving][depth]
+ Depth Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
- inline Value futility_margin(Depth d) {
- return Value(200 * d);
+ template <bool PvNode> inline Depth reduction(bool i, Depth d, int mn) {
+ return Reductions[PvNode][i][std::min(d, 63 * ONE_PLY)][std::min(mn, 63)];
}
- // Reduction lookup tables (initialized at startup) and their access function
- int8_t Reductions[2][2][64][64]; // [pv][improving][depth][moveNumber]
+ // Skill struct is used to implement strength limiting
+ struct Skill {
+ 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);
- template <bool PvNode> inline Depth reduction(bool i, Depth d, int mn) {
- return (Depth) Reductions[PvNode][i][std::min(int(d), 63)][std::min(mn, 63)];
- }
+ int level;
+ Move best = MOVE_NONE;
+ };
size_t PVIdx;
TimeManager TimeMgr;
Value value_from_tt(Value v, int ply);
void update_pv(Move* pv, Move move, Move* childPv);
void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt);
- string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta);
-
- struct Skill {
- 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;
- Move best = MOVE_NONE;
- };
} // namespace
void Search::init() {
- // Init reductions array
- for (int d = 1; d < 64; ++d)
- for (int mc = 1; mc < 64; ++mc)
- {
- double pvRed = 0.00 + log(double(d)) * log(double(mc)) / 3.00;
- double nonPVRed = 0.33 + log(double(d)) * log(double(mc)) / 2.25;
+ const double K[][2] = {{ 0.83, 2.25 }, { 0.50, 3.00 }};
- Reductions[1][1][d][mc] = int8_t( pvRed >= 1.0 ? pvRed + 0.5: 0);
- Reductions[0][1][d][mc] = int8_t(nonPVRed >= 1.0 ? nonPVRed + 0.5: 0);
+ for (int pv = 0; pv <= 1; ++pv)
+ for (int imp = 0; imp <= 1; ++imp)
+ for (int d = 1; d < 64; ++d)
+ for (int mc = 1; mc < 64; ++mc)
+ {
+ double r = K[pv][0] + log(d) * log(mc) / K[pv][1];
- Reductions[1][0][d][mc] = Reductions[1][1][d][mc];
- Reductions[0][0][d][mc] = Reductions[0][1][d][mc];
+ if (r >= 1.5)
+ Reductions[pv][imp][d][mc] = int(r) * ONE_PLY;
- // Increase reduction when eval is not improving
- if (Reductions[0][0][d][mc] >= 2)
- Reductions[0][0][d][mc] += 1;
- }
+ // Increase reduction when eval is not improving
+ if (!pv && !imp && Reductions[pv][imp][d][mc] >= 2 * ONE_PLY)
+ Reductions[pv][imp][d][mc] += ONE_PLY;
+ }
- // Init futility move count array
for (int d = 0; d < 16; ++d)
{
FutilityMoveCounts[0][d] = int(2.4 + 0.773 * pow(d + 0.00, 1.8));
sync_cout << "bestmove " << UCI::move(RootMoves[0].pv[0], RootPos.is_chess960());
- if (RootMoves[0].pv.size() > 1)
+ if (RootMoves[0].pv.size() > 1 || RootMoves[0].extract_ponder_from_tt(RootPos))
std::cout << " ponder " << UCI::move(RootMoves[0].pv[1], RootPos.is_chess960());
std::cout << sync_endl;
// When failing high/low give some update (without cluttering
// the UI) before a re-search.
- if ( (bestValue <= alpha || bestValue >= beta)
+ if ( multiPV == 1
+ && (bestValue <= alpha || bestValue >= beta)
&& Time::now() - SearchTime > 3000)
- sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
+ sync_cout << UCI::pv(pos, depth, alpha, beta) << sync_endl;
// In case of failing low/high increase aspiration window and
// re-search, otherwise exit the loop.
<< " time " << Time::now() - SearchTime << sync_endl;
else if (PVIdx + 1 == multiPV || Time::now() - SearchTime > 3000)
- sync_cout << uci_pv(pos, depth, alpha, beta) << sync_endl;
+ sync_cout << UCI::pv(pos, depth, alpha, beta) << sync_endl;
}
// If skill level is enabled and time is up, pick a sub-optimal best move
newDepth = depth - ONE_PLY + extension;
// Step 13. Pruning at shallow depth
- if ( !captureOrPromotion
+ if ( !RootNode
+ && !captureOrPromotion
&& !inCheck
&& !dangerous
&& bestValue > VALUE_MATED_IN_MAX_PLY)
// played quiet moves.
Value bonus = Value((depth / ONE_PLY) * (depth / ONE_PLY));
History.update(pos.moved_piece(move), to_sq(move), bonus);
+
for (int i = 0; i < quietsCnt; ++i)
{
Move m = quiets[i];
{
int score = RootMoves[i].score;
- // Don't allow crazy blunders even at very low skills
- if (i > 0 && RootMoves[i - 1].score > score + 2 * PawnValueMg)
- break;
-
// This is our magic formula
score += ( weakness * int(RootMoves[0].score - score)
+ variance * (rng.rand<unsigned>() % weakness)) / 128;
return best;
}
+} // namespace
- // uci_pv() formats PV information according to the UCI protocol. UCI
- // requires that all (if any) unsearched PV lines are sent using a previous
- // search score.
- string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta) {
+/// UCI::pv() formats PV information according to the UCI protocol. UCI requires
+/// that all (if any) unsearched PV lines are sent using a previous search score.
- std::stringstream ss;
- Time::point elapsed = Time::now() - SearchTime + 1;
- size_t uciPVSize = std::min((size_t)Options["MultiPV"], RootMoves.size());
- int selDepth = 0;
+string UCI::pv(const Position& pos, Depth depth, Value alpha, Value beta) {
- for (Thread* th : Threads)
- if (th->maxPly > selDepth)
- selDepth = th->maxPly;
+ std::stringstream ss;
+ Time::point elapsed = Time::now() - SearchTime + 1;
+ size_t multiPV = std::min((size_t)Options["MultiPV"], RootMoves.size());
+ int selDepth = 0;
- for (size_t i = 0; i < uciPVSize; ++i)
- {
- bool updated = (i <= PVIdx);
+ for (Thread* th : Threads)
+ if (th->maxPly > selDepth)
+ selDepth = th->maxPly;
- if (depth == ONE_PLY && !updated)
- continue;
+ for (size_t i = 0; i < multiPV; ++i)
+ {
+ bool updated = (i <= PVIdx);
- Depth d = updated ? depth : depth - ONE_PLY;
- Value v = updated ? RootMoves[i].score : RootMoves[i].previousScore;
+ if (depth == ONE_PLY && !updated)
+ continue;
- bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
- v = tb ? TB::Score : v;
+ Depth d = updated ? depth : depth - ONE_PLY;
+ Value v = updated ? RootMoves[i].score : RootMoves[i].previousScore;
- if (ss.rdbuf()->in_avail()) // Not at first line
- ss << "\n";
+ bool tb = TB::RootInTB && abs(v) < VALUE_MATE - MAX_PLY;
+ v = tb ? TB::Score : v;
- ss << "info depth " << d / ONE_PLY
- << " seldepth " << selDepth
- << " multipv " << i + 1
- << " score " << UCI::value(v);
+ if (ss.rdbuf()->in_avail()) // Not at first line
+ ss << "\n";
- if (!tb && i == PVIdx)
- ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
+ ss << "info"
+ << " depth " << d / ONE_PLY
+ << " seldepth " << selDepth
+ << " multipv " << i + 1
+ << " score " << UCI::value(v);
- ss << " nodes " << pos.nodes_searched()
- << " nps " << pos.nodes_searched() * 1000 / elapsed
- << " tbhits " << TB::Hits
- << " time " << elapsed
- << " pv";
+ if (!tb && i == PVIdx)
+ ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
- for (size_t j = 0; j < RootMoves[i].pv.size(); ++j)
- ss << " " << UCI::move(RootMoves[i].pv[j], pos.is_chess960());
- }
+ ss << " nodes " << pos.nodes_searched()
+ << " nps " << pos.nodes_searched() * 1000 / elapsed;
+
+ if (elapsed > 1000) // Earlier makes little sense
+ ss << " hashfull " << TT.hashfull();
- return ss.str();
+ ss << " tbhits " << TB::Hits
+ << " time " << elapsed
+ << " pv";
+
+ for (Move m : RootMoves[i].pv)
+ ss << " " << UCI::move(m, pos.is_chess960());
}
-} // namespace
+ return ss.str();
+}
/// RootMove::insert_pv_in_tt() is called at the end of a search iteration, and
void RootMove::insert_pv_in_tt(Position& pos) {
StateInfo state[MAX_PLY], *st = state;
- size_t idx = 0;
+ bool ttHit;
- for ( ; idx < pv.size(); ++idx)
+ for (Move m : pv)
{
- bool ttHit;
- TTEntry* tte = TT.probe(pos.key(), ttHit);
+ assert(MoveList<LEGAL>(pos).contains(m));
- if (!ttHit || tte->move() != pv[idx]) // Don't overwrite correct entries
- tte->save(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, pv[idx], VALUE_NONE, TT.generation());
+ TTEntry* tte = TT.probe(pos.key(), ttHit);
- assert(MoveList<LEGAL>(pos).contains(pv[idx]));
+ if (!ttHit || tte->move() != m) // Don't overwrite correct entries
+ tte->save(pos.key(), VALUE_NONE, BOUND_NONE, DEPTH_NONE, m, VALUE_NONE, TT.generation());
- pos.do_move(pv[idx], *st++);
+ pos.do_move(m, *st++);
}
- while (idx) pos.undo_move(pv[--idx]);
+ for (size_t i = pv.size(); i > 0; )
+ pos.undo_move(pv[--i]);
+}
+
+
+/// RootMove::extract_ponder_from_tt() is called in case we have no ponder move before
+/// exiting the search, for instance in case we stop the search during a fail high at
+/// root. We try hard to have a ponder move to return to the GUI, otherwise in case of
+/// 'ponder on' we have nothing to think on.
+
+bool RootMove::extract_ponder_from_tt(Position& pos)
+{
+ StateInfo st;
+ bool ttHit;
+
+ assert(pv.size() == 1);
+
+ pos.do_move(pv[0], st);
+ TTEntry* tte = TT.probe(pos.key(), ttHit);
+ pos.undo_move(pv[0]);
+
+ if (ttHit)
+ {
+ Move m = tte->move(); // Local copy to be SMP safe
+ if (MoveList<LEGAL>(pos).contains(m))
+ return pv.push_back(m), true;
+ }
+
+ return false;
}
projects / stockfish / blobdiff