-
-
-/// move_to_san() takes a position and a legal Move as input and returns its
-/// short algebraic notation representation.
-
-const string move_to_san(Position& pos, Move m) {
-
- if (m == MOVE_NONE)
- return "(none)";
-
- if (m == MOVE_NULL)
- return "(null)";
-
- assert(pos.move_is_legal(m));
-
- Bitboard attackers;
- bool ambiguousMove, ambiguousFile, ambiguousRank;
- string san;
- Color us = pos.side_to_move();
- Square from = from_sq(m);
- Square to = to_sq(m);
- Piece pc = pos.piece_on(from);
- PieceType pt = type_of(pc);
-
- if (type_of(m) == CASTLE)
- san = to > from ? "O-O" : "O-O-O";
- else
- {
- if (pt != PAWN)
- {
- san = PieceToChar[pt]; // Upper case
-
- // Disambiguation if we have more then one piece with destination 'to'
- // note that for pawns is not needed because starting file is explicit.
- ambiguousMove = ambiguousFile = ambiguousRank = false;
-
- attackers = (pos.attacks_from(pc, to) & pos.pieces(us, pt)) ^ from;
-
- while (attackers)
- {
- Square sq = pop_lsb(&attackers);
-
- // Pinned pieces are not included in the possible sub-set
- if (!pos.pl_move_is_legal(make_move(sq, to), pos.pinned_pieces()))
- continue;
-
- ambiguousFile |= file_of(sq) == file_of(from);
- ambiguousRank |= rank_of(sq) == rank_of(from);
- ambiguousMove = true;
- }
-
- if (ambiguousMove)
- {
- if (!ambiguousFile)
- san += file_to_char(file_of(from));
-
- else if (!ambiguousRank)
- san += rank_to_char(rank_of(from));
-
- else
- san += square_to_string(from);
- }
- }
- else if (pos.is_capture(m))
- san = file_to_char(file_of(from));
-
- if (pos.is_capture(m))
- san += 'x';
-
- san += square_to_string(to);
-
- if (type_of(m) == PROMOTION)
- san += string("=") + PieceToChar[promotion_type(m)];
- }
-
- if (pos.move_gives_check(m, CheckInfo(pos)))
- {
- StateInfo st;
- pos.do_move(m, st);
- san += MoveList<LEGAL>(pos).size() ? "+" : "#";
- pos.undo_move(m);
- }
-
- return san;
-}
-
-
-/// pretty_pv() formats human-readable search information, typically to be
-/// appended to the search log file. It uses the two helpers below to pretty
-/// format time and score respectively.
-
-static string time_to_string(int millisecs) {
-
- const int MSecMinute = 1000 * 60;
- const int MSecHour = 1000 * 60 * 60;
-
- int hours = millisecs / MSecHour;
- int minutes = (millisecs % MSecHour) / MSecMinute;
- int seconds = ((millisecs % MSecHour) % MSecMinute) / 1000;
-
- stringstream s;
-
- if (hours)
- s << hours << ':';
-
- s << setfill('0') << setw(2) << minutes << ':' << setw(2) << seconds;
-
- return s.str();
-}
-
-static string score_to_string(Value v) {
-
- stringstream s;
-
- if (v >= VALUE_MATE_IN_MAX_PLY)
- s << "#" << (VALUE_MATE - v + 1) / 2;
-
- else if (v <= VALUE_MATED_IN_MAX_PLY)
- s << "-#" << (VALUE_MATE + v) / 2;
-
- else
- s << setprecision(2) << fixed << showpos << float(v) / PawnValueMg;
-
- return s.str();
-}
-
-string pretty_pv(Position& pos, int depth, Value value, int time, Move pv[]) {
-
- const int64_t K = 1000;
- const int64_t M = 1000000;
-
- StateInfo state[MAX_PLY_PLUS_2], *st = state;
- Move* m = pv;
- string san, padding;
- size_t length;
- stringstream s;
-
- s << setw(2) << depth
- << setw(8) << score_to_string(value)
- << setw(8) << time_to_string(time);
-
- if (pos.nodes_searched() < M)
- s << setw(8) << pos.nodes_searched() / 1 << " ";
-
- else if (pos.nodes_searched() < K * M)
- s << setw(7) << pos.nodes_searched() / K << "K ";
-
- else
- s << setw(7) << pos.nodes_searched() / M << "M ";
-
- padding = string(s.str().length(), ' ');
- length = padding.length();
-
- while (*m != MOVE_NONE)
- {
- san = move_to_san(pos, *m);
-
- if (length + san.length() > 80)
- {
- s << "\n" + padding;
- length = padding.length();
- }
-
- s << san << ' ';
- length += san.length() + 1;
-
- pos.do_move(*m++, *st++);
- }
-
- while (m != pv)
- pos.undo_move(*--m);
-
- return s.str();
-}