HCha/Stockfish
1
0
Fork 0
mirror of https://github.com/HChaZZY/Stockfish.git synced 2025-12-21 09:37:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retire Search Log

Browse Source 
No functional change

Bench: 7461881
This commit is contained in:
lucasart
2014-08-24 16:28:51 +01:00
committed by Joona Kiiski
parent 8b8885ab07
commit 877313a413
4 changed files with 0 additions and 106 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
src/search.cpp
View File

@@ -19,7 +19,6 @@
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstring>
#include <iostream>
@@ -202,18 +201,6 @@ void Search::think() {
goto finalize;
}
if (Options["Write Search Log"])
{
Log log(Options["Search Log Filename"]);
log << "\nSearching: " << RootPos.fen()
<< "\ninfinite: " << Limits.infinite
<< " ponder: " << Limits.ponder
<< " time: " << Limits.time[RootPos.side_to_move()]
<< " increment: " << Limits.inc[RootPos.side_to_move()]
<< " moves to go: " << Limits.movestogo
<< "\n" << std::endl;
}
// Reset the threads, still sleeping: will wake up at split time
for (size_t i = 0; i < Threads.size(); ++i)
Threads[i]->maxPly = 0;
@@ -225,18 +212,6 @@ void Search::think() {
Threads.timer->run = false; // Stop the timer
if (Options["Write Search Log"])
{
Time::point elapsed = Time::now() - SearchTime + 1;
Log log(Options["Search Log Filename"]);
log << "Nodes: " << RootPos.nodes_searched()
<< "\nNodes/second: " << RootPos.nodes_searched() * 1000 / elapsed
<< "\nBest move: " << move_to_uci(RootMoves[0].pv[0], RootPos.is_chess960())
<< "\nPonder move: " << move_to_uci(RootMoves[0].pv[1], RootPos.is_chess960())
<< std::endl;
}
finalize:
// When search is stopped this info is not printed
@@ -378,17 +353,6 @@ namespace {
if (skill.candidates_size() && skill.time_to_pick(depth))
skill.pick_move();
if (Options["Write Search Log"])
{
RootMove& rm = RootMoves[0];
if (skill.best != MOVE_NONE)
rm = *std::find(RootMoves.begin(), RootMoves.end(), skill.best);
Log log(Options["Search Log Filename"]);
log << pretty_pv(pos, depth, rm.score, Time::now() - SearchTime, &rm.pv[0])
<< std::endl;
}
// Have we found a "mate in x"?
if ( Limits.mate
&& bestValue >= VALUE_MATE_IN_MAX_PLY