X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fnotation.cpp;h=a2d898adf3e21289a17e477ca45111afab2171fe;hp=3f2499edccbdc7277c1ab21b8c87d7cb009886ad;hb=15e21911110f9d459c4fef2bb17903d97345d0b9;hpb=698b645e10388366ca0400bc05c21af98b7703b2 diff --git a/src/notation.cpp b/src/notation.cpp index 3f2499ed..a2d898ad 100644 --- a/src/notation.cpp +++ b/src/notation.cpp @@ -18,9 +18,7 @@ */ #include -#include #include -#include #include "movegen.h" #include "notation.h" @@ -40,16 +38,16 @@ static const char* PieceToChar[COLOR_NB] = { " PNBRQK", " pnbrqk" }; string score_to_uci(Value v, Value alpha, Value beta) { - stringstream s; + stringstream ss; if (abs(v) < VALUE_MATE_IN_MAX_PLY) - s << "cp " << v * 100 / int(PawnValueMg); + ss << "cp " << v * 100 / PawnValueEg; else - s << "mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2; + ss << "mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2; - s << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : ""); + ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : ""); - return s.str(); + return ss.str(); } @@ -95,169 +93,3 @@ Move move_from_uci(const Position& pos, string& str) { return MOVE_NONE; } - - -/// 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(MoveList(pos).contains(m)); - - Bitboard others, b; - 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) == CASTLING) - san = to > from ? "O-O" : "O-O-O"; - else - { - if (pt != PAWN) - { - san = PieceToChar[WHITE][pt]; // Upper case - - // A disambiguation occurs if we have more then one piece of type 'pt' - // that can reach 'to' with a legal move. - others = b = (pos.attacks_from(pc, to) & pos.pieces(us, pt)) ^ from; - - while (b) - { - Square sq = pop_lsb(&b); - if (!pos.legal(make_move(sq, to), pos.pinned_pieces(us))) - others ^= sq; - } - - if (!others) - { /* disambiguation is not needed */ } - - else if (!(others & file_bb(from))) - san += to_char(file_of(from)); - - else if (!(others & rank_bb(from))) - san += to_char(rank_of(from)); - - else - san += to_string(from); - } - else if (pos.capture(m)) - san = to_char(file_of(from)); - - if (pos.capture(m)) - san += 'x'; - - san += to_string(to); - - if (type_of(m) == PROMOTION) - san += string("=") + PieceToChar[WHITE][promotion_type(m)]; - } - - if (pos.gives_check(m, CheckInfo(pos))) - { - StateInfo st; - pos.do_move(m, st); - san += MoveList(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 the time and score respectively. - -static string time_to_string(int64_t msecs) { - - const int MSecMinute = 1000 * 60; - const int MSecHour = 1000 * 60 * 60; - - int64_t hours = msecs / MSecHour; - int64_t minutes = (msecs % MSecHour) / MSecMinute; - int64_t seconds = ((msecs % 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 << double(v) / PawnValueMg; - - return s.str(); -} - -string pretty_pv(Position& pos, int depth, Value value, uint64_t msecs, Move pv[]) { - - const uint64_t K = 1000; - const uint64_t M = 1000000; - - std::stack st; - 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(msecs); - - 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; - - st.push(StateInfo()); - pos.do_move(*m++, st.top()); - } - - while (m != pv) - pos.undo_move(*--m); - - return s.str(); -}