Time.availableNodes = 0;
TT.clear();
Threads.clear();
+ Tablebases::init(Options["SyzygyPath"]); // Free up mapped files
}
size_t pvFirst = 0;
pvLast = 0;
- Depth adjustedDepth = rootDepth;
// MultiPV loop. We perform a full root search for each PV line
for (pvIdx = 0; pvIdx < multiPV && !Threads.stop; ++pvIdx)
if (rootDepth >= 5 * ONE_PLY)
{
Value previousScore = rootMoves[pvIdx].previousScore;
- delta = Value(18);
+ delta = Value(20);
alpha = std::max(previousScore - delta,-VALUE_INFINITE);
beta = std::min(previousScore + delta, VALUE_INFINITE);
int failedHighCnt = 0;
while (true)
{
- adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY);
+ Depth adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY);
bestValue = ::search<PV>(rootPos, ss, alpha, beta, adjustedDepth, false);
// Bring the best move to the front. It is critical that sorting
&& multiPV == 1
&& (bestValue <= alpha || bestValue >= beta)
&& Time.elapsed() > 3000)
- sync_cout << UCI::pv(rootPos, adjustedDepth, alpha, beta) << sync_endl;
+ sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
// In case of failing low/high increase aspiration window and
// re-search, otherwise exit the loop.
if ( mainThread
&& (Threads.stop || pvIdx + 1 == multiPV || Time.elapsed() > 3000))
- sync_cout << UCI::pv(rootPos, adjustedDepth, alpha, beta) << sync_endl;
+ sync_cout << UCI::pv(rootPos, rootDepth, alpha, beta) << sync_endl;
}
if (!Threads.stop)
- completedDepth = adjustedDepth;
+ completedDepth = rootDepth;
if (rootMoves[0].pv[0] != lastBestMove) {
lastBestMove = rootMoves[0].pv[0];
- lastBestMoveDepth = adjustedDepth;
+ lastBestMoveDepth = rootDepth;
}
// Have we found a "mate in x"?
&& pos.see_ge(move))
extension = ONE_PLY;
+ // Extension for king moves that change castling rights
+ if ( pos.can_castle(us)
+ && type_of(movedPiece) == KING
+ && depth < 12 * ONE_PLY)
+ extension = ONE_PLY;
+
// Calculate new depth for this move
newDepth = depth - ONE_PLY + extension;