- // The move gives check? We don't use pos.move_is_check() here
- // because we need to test for a mate after the move is done.
- StateInfo st;
- pos.do_move(m, st);
- if (pos.is_check())
- san += pos.is_mate() ? "#" : "+";
- pos.undo_move(m);
-
- return san;
-}
-
-
-/// pretty_pv() creates a human-readable string from a position and a PV.
-/// It is used to write search information to the log file (which is created
-/// when the UCI parameter "Use Search Log" is "true").
-
-const string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]) {
-
- const int64_t K = 1000;
- const int64_t M = 1000000;
- const int startColumn = 28;
- const size_t maxLength = 80 - startColumn;
- const string lf = string("\n") + string(startColumn, ' ');
-
- StateInfo state[PLY_MAX_PLUS_2], *st = state;
- Move* m = pv;
- string san;
- std::stringstream s;
- size_t length = 0;
-
- // First print depth, score, time and searched nodes...
- s << std::setw(2) << depth
- << std::setw(8) << score_string(score)
- << std::setw(8) << time_string(time);
-
- if (pos.nodes_searched() < M)
- s << std::setw(8) << pos.nodes_searched() / 1 << " ";
- else if (pos.nodes_searched() < K * M)
- s << std::setw(7) << pos.nodes_searched() / K << "K ";
- else
- s << std::setw(7) << pos.nodes_searched() / M << "M ";
-
- // ...then print the full PV line in short algebraic notation
- while (*m != MOVE_NONE)