2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
33 const string time_string(int milliseconds);
34 const string score_string(Value v);
38 /// move_to_uci() converts a move to a string in coordinate notation
39 /// (g1f3, a7a8q, etc.). The only special case is castling moves, where we
40 /// print in the e1g1 notation in normal chess mode, and in e1h1 notation in
43 const string move_to_uci(Move m, bool chess960) {
45 Square from = move_from(m);
46 Square to = move_to(m);
55 if (move_is_short_castle(m) && !chess960)
56 return from == SQ_E1 ? "e1g1" : "e8g8";
58 if (move_is_long_castle(m) && !chess960)
59 return from == SQ_E1 ? "e1c1" : "e8c8";
61 if (move_is_promotion(m))
62 promotion = char(tolower(piece_type_to_char(move_promotion_piece(m))));
64 return square_to_string(from) + square_to_string(to) + promotion;
68 /// move_from_uci() takes a position and a string representing a move in
69 /// simple coordinate notation and returns an equivalent Move.
71 Move move_from_uci(const Position& pos, const string& str) {
73 MoveStack mlist[MOVES_MAX];
74 MoveStack* last = generate<MV_LEGAL>(pos, mlist);
76 for (MoveStack* cur = mlist; cur != last; cur++)
77 if (str == move_to_uci(cur->move, pos.is_chess960()))
84 /// move_to_san() takes a position and a move as input, where it is assumed
85 /// that the move is a legal move from the position. The return value is
86 /// a string containing the move in short algebraic notation.
88 const string move_to_san(Position& pos, Move m) {
91 assert(move_is_ok(m));
93 MoveStack mlist[MOVES_MAX];
94 Square from = move_from(m);
95 Square to = move_to(m);
96 PieceType pt = pos.type_of_piece_on(from);
105 if (move_is_long_castle(m))
107 else if (move_is_short_castle(m))
113 san = piece_type_to_char(pt);
115 // Collect all legal moves of piece type 'pt' with destination 'to'
116 MoveStack* last = generate<MV_LEGAL>(pos, mlist);
119 for (MoveStack* cur = mlist; cur != last; cur++)
120 if ( move_to(cur->move) == to
121 && pos.type_of_piece_on(move_from(cur->move)) == pt)
123 if (square_file(move_from(cur->move)) == square_file(from))
126 if (square_rank(move_from(cur->move)) == square_rank(from))
130 assert(f > 0 && r > 0);
132 // Disambiguation if we have more then one piece with destination 'to'
134 san += file_to_char(square_file(from));
135 else if (f > 1 && r == 1)
136 san += rank_to_char(square_rank(from));
137 else if (f > 1 && r > 1)
138 san += square_to_string(from);
141 if (pos.move_is_capture(m))
144 san += file_to_char(square_file(from));
149 san += square_to_string(to);
151 if (move_is_promotion(m))
154 san += piece_type_to_char(move_promotion_piece(m));
158 // The move gives check? We don't use pos.move_is_check() here
159 // because we need to test for a mate after the move is done.
163 san += pos.is_mate() ? "#" : "+";
170 /// pretty_pv() creates a human-readable string from a position and a PV.
171 /// It is used to write search information to the log file (which is created
172 /// when the UCI parameter "Use Search Log" is "true").
174 const string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]) {
176 const int64_t K = 1000;
177 const int64_t M = 1000000;
178 const int startColumn = 28;
179 const size_t maxLength = 80 - startColumn;
180 const string lf = string("\n") + string(startColumn, ' ');
182 StateInfo state[PLY_MAX_PLUS_2], *st = state;
188 // First print depth, score, time and searched nodes...
189 s << std::setw(2) << depth
190 << std::setw(8) << score_string(score)
191 << std::setw(8) << time_string(time);
193 if (pos.nodes_searched() < M)
194 s << std::setw(8) << pos.nodes_searched() / 1 << " ";
195 else if (pos.nodes_searched() < K * M)
196 s << std::setw(7) << pos.nodes_searched() / K << "K ";
198 s << std::setw(7) << pos.nodes_searched() / M << "M ";
200 // ...then print the full PV line in short algebraic notation
201 while (*m != MOVE_NONE)
203 san = move_to_san(pos, *m);
204 length += san.length() + 1;
206 if (length > maxLength)
208 length = san.length() + 1;
213 pos.do_move(*m++, *st++);
216 // Restore original position before to leave
217 while (m != pv) pos.undo_move(*--m);
225 const string time_string(int millisecs) {
227 const int MSecMinute = 1000 * 60;
228 const int MSecHour = 1000 * 60 * 60;
230 int hours = millisecs / MSecHour;
231 int minutes = (millisecs % MSecHour) / MSecMinute;
232 int seconds = ((millisecs % MSecHour) % MSecMinute) / 1000;
239 s << std::setfill('0') << std::setw(2) << minutes << ':' << std::setw(2) << seconds;
244 const string score_string(Value v) {
248 if (v >= VALUE_MATE - 200)
249 s << "#" << (VALUE_MATE - v + 1) / 2;
250 else if (v <= -VALUE_MATE + 200)
251 s << "-#" << (VALUE_MATE + v) / 2;
253 s << std::setprecision(2) << std::fixed << std::showpos << float(v) / PawnValueMidgame;