kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-07-12 03:59:15 +00:00
Code Issues Releases Wiki Activity

Retire UseLogFile in search.cpp

Browse source 
No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2011-04-23 14:57:05 +01:00
parent 1d368bbbdc
commit 8b2adcf99e
1 changed files with 11 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
src/search.cpp
View file

@ -238,7 +238,6 @@ namespace {
SearchLimits Limits; SearchLimits Limits;
// Log file // Log file
bool UseLogFile;
std::ofstream LogFile; std::ofstream LogFile;
// Skill level adjustment // Skill level adjustment
@ -488,7 +487,6 @@ bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
PawnEndgameExtension[0] = Options["Pawn Endgame Extension (non-PV nodes)"].value<Depth>(); PawnEndgameExtension[0] = Options["Pawn Endgame Extension (non-PV nodes)"].value<Depth>();
UCIMultiPV = Options["MultiPV"].value<int>(); UCIMultiPV = Options["MultiPV"].value<int>();
SkillLevel = Options["Skill level"].value<int>(); SkillLevel = Options["Skill level"].value<int>();
UseLogFile = Options["Use Search Log"].value<bool>();
read_evaluation_uci_options(pos.side_to_move()); read_evaluation_uci_options(pos.side_to_move());
@ -516,18 +514,19 @@ bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
} }
// Write to log file and keep it open to be accessed during the search // Write to log file and keep it open to be accessed during the search
if (UseLogFile) if (Options["Use Search Log"].value<bool>())
{ {
std::string name = Options["Search Log Filename"].value<std::string>(); std::string name = Options["Search Log Filename"].value<std::string>();
LogFile.open(name.c_str(), std::ios::out | std::ios::app); LogFile.open(name.c_str(), std::ios::out | std::ios::app);
LogFile << "\nSearching: " << pos.to_fen() if (LogFile.is_open())
<< "\ninfinite: " << Limits.infinite LogFile << "\nSearching: " << pos.to_fen()
<< " ponder: " << Limits.ponder << "\ninfinite: " << Limits.infinite
<< " time: " << Limits.time << " ponder: " << Limits.ponder
<< " increment: " << Limits.increment << " time: " << Limits.time
<< " moves to go: " << Limits.movesToGo << " increment: " << Limits.increment
<< endl; << " moves to go: " << Limits.movesToGo
<< endl;
} }
// We're ready to start thinking. Call the iterative deepening loop function // We're ready to start thinking. Call the iterative deepening loop function
@ -537,7 +536,7 @@ bool think(Position& pos, const SearchLimits& limits, Move searchMoves[]) {
cout << "info" << speed_to_uci(pos.nodes_searched()) << endl; cout << "info" << speed_to_uci(pos.nodes_searched()) << endl;
// Write final search statistics and close log file // Write final search statistics and close log file
if (UseLogFile) if (LogFile.is_open())
{ {
int t = current_search_time(); int t = current_search_time();
@ -687,7 +686,7 @@ namespace {
for (int i = 0; i < Min(UCIMultiPV, (int)Rml.size()); i++) for (int i = 0; i < Min(UCIMultiPV, (int)Rml.size()); i++)
cout << Rml[i].pv_info_to_uci(pos, depth, selDepth, alpha, beta, i) << endl; cout << Rml[i].pv_info_to_uci(pos, depth, selDepth, alpha, beta, i) << endl;
if (UseLogFile) if (LogFile.is_open())
LogFile << pretty_pv(pos, depth, value, current_search_time(), Rml[0].pv) << endl; LogFile << pretty_pv(pos, depth, value, current_search_time(), Rml[0].pv) << endl;
// Init easyMove after first iteration or drop if differs from the best move // Init easyMove after first iteration or drop if differs from the best move