-
-
-/// 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;
- std::stringstream s;
- string san;
- 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)
- {
- san = move_to_san(pos, *m);
- length += san.length() + 1;
-
- if (length > maxLength)
- {
- length = san.length() + 1;
- s << lf;
- }
- s << san << ' ';
-
- pos.do_move(*m++, *st++);
- }
-
- // Restore original position before to leave
- while (m != pv) pos.undo_move(*--m);
-
- return s.str();
-}
-
-
-namespace {
-
- Ambiguity move_ambiguity(const Position& pos, Move m) {
-
- MoveStack mlist[MOVES_MAX], *last;
- Move candidates[8];
- Square from = move_from(m);
- Square to = move_to(m);
- Piece pc = pos.piece_on(from);
- int matches = 0, f = 0, r = 0;
-
- // If there is only one piece 'pc' then move cannot be ambiguous
- if (pos.piece_count(pos.side_to_move(), type_of_piece(pc)) == 1)
- return AMBIGUITY_NONE;
-
- // Collect all legal moves of piece 'pc' with destination 'to'
- last = generate<MV_LEGAL>(pos, mlist);
- for (MoveStack* cur = mlist; cur != last; cur++)
- if (move_to(cur->move) == to && pos.piece_on(move_from(cur->move)) == pc)
- candidates[matches++] = cur->move;
-
- if (matches == 1)
- return AMBIGUITY_NONE;
-
- for (int i = 0; i < matches; i++)
- {
- if (square_file(move_from(candidates[i])) == square_file(from))
- f++;
-
- if (square_rank(move_from(candidates[i])) == square_rank(from))
- r++;
- }
-
- return f == 1 ? AMBIGUITY_FILE : r == 1 ? AMBIGUITY_RANK : AMBIGUITY_BOTH;
- }
-
-
- const string time_string(int millisecs) {
-
- const int MSecMinute = 1000 * 60;
- const int MSecHour = 1000 * 60 * 60;
-
- std::stringstream s;
- s << std::setfill('0');
-
- int hours = millisecs / MSecHour;
- int minutes = (millisecs - hours * MSecHour) / MSecMinute;
- int seconds = (millisecs - hours * MSecHour - minutes * MSecMinute) / 1000;
-
- if (hours)
- s << hours << ':';
-
- s << std::setw(2) << minutes << ':' << std::setw(2) << seconds;
- return s.str();
- }
-
-
- const string score_string(Value v) {
-
- std::stringstream s;
-
- if (v >= VALUE_MATE - 200)
- s << "#" << (VALUE_MATE - v + 1) / 2;
- else if (v <= -VALUE_MATE + 200)
- s << "-#" << (VALUE_MATE + v) / 2;
- else
- {
- float floatScore = float(v) / float(PawnValueMidgame);
- if (v >= 0)
- s << '+';
-
- s << std::setprecision(2) << std::fixed << floatScore;
- }
- return s.str();
- }
-}