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/>.
38 //// Local definitions
50 const History H; // used as dummy argument for MovePicker c'tor
52 Ambiguity move_ambiguity(const Position& pos, Move m);
53 const string time_string(int milliseconds);
54 const string score_string(Value v);
62 /// move_to_san() takes a position and a move as input, where it is assumed
63 /// that the move is a legal move from the position. The return value is
64 /// a string containing the move in short algebraic notation.
66 const string move_to_san(Position& pos, Move m) {
69 assert(move_is_ok(m));
76 pt = type_of_piece(pos.piece_on(move_from(m)));
82 else if (m == MOVE_NULL)
84 else if (move_is_long_castle(m) || (int(to - from) == -2 && pt == KING))
86 else if (move_is_short_castle(m) || (int(to - from) == 2 && pt == KING))
92 san += piece_type_to_char(pt, true);
93 switch (move_ambiguity(pos, m)) {
97 san += file_to_char(square_file(from));
100 san += rank_to_char(square_rank(from));
103 san += square_to_string(from);
109 if (pos.move_is_capture(m))
112 san += file_to_char(square_file(move_from(m)));
115 san += square_to_string(move_to(m));
116 if (move_is_promotion(m))
119 san += piece_type_to_char(move_promotion_piece(m), true);
122 // Is the move check? We don't use pos.move_is_check(m) here, because
123 // Position::move_is_check doesn't detect all checks (not castling moves,
124 // promotions and en passant captures).
128 san += pos.is_mate() ? "#" : "+";
135 /// move_from_san() takes a position and a string as input, and tries to
136 /// interpret the string as a move in short algebraic notation. On success,
137 /// the move is returned. On failure (i.e. if the string is unparsable, or
138 /// if the move is illegal or ambiguous), MOVE_NONE is returned.
140 Move move_from_san(const Position& pos, const string& movestr) {
144 MovePicker mp = MovePicker(pos, MOVE_NONE, OnePly, H);
145 Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
148 if (movestr == "O-O-O" || movestr == "O-O-O+")
151 while ((m = mp.get_next_move()) != MOVE_NONE)
152 if (move_is_long_castle(m) && pos.pl_move_is_legal(m, pinned))
157 else if (movestr == "O-O" || movestr == "O-O+")
160 while ((m = mp.get_next_move()) != MOVE_NONE)
161 if (move_is_short_castle(m) && pos.pl_move_is_legal(m, pinned))
167 // Normal moves. We use a simple FSM to parse the san string.
168 enum { START, TO_FILE, TO_RANK, PROMOTION_OR_CHECK, PROMOTION, CHECK, END };
169 static const string pieceLetters = "KQRBN";
170 PieceType pt = NO_PIECE_TYPE, promotion = NO_PIECE_TYPE;
171 File fromFile = FILE_NONE, toFile = FILE_NONE;
172 Rank fromRank = RANK_NONE, toRank = RANK_NONE;
176 for (size_t i = 0; i < movestr.length(); i++)
178 char type, c = movestr[i];
179 if (pieceLetters.find(c) != string::npos)
181 else if (c >= 'a' && c <= 'h')
183 else if (c >= '1' && c <= '8')
192 pt = piece_type_from_char(c);
195 else if (state == PROMOTION)
197 promotion = piece_type_from_char(c);
198 state = (i < movestr.length() - 1) ? CHECK : END;
207 fromFile = toFile = file_from_char(c);
210 else if (state == TO_FILE)
212 toFile = file_from_char(c);
215 else if (state == TO_RANK && toFile != FILE_NONE)
217 // Previous file was for disambiguation
219 toFile = file_from_char(c);
225 if (state == TO_RANK)
227 toRank = rank_from_char(c);
228 state = (i < movestr.length() - 1) ? PROMOTION_OR_CHECK : END;
230 else if (state == TO_FILE && fromRank == RANK_NONE)
232 // It's a disambiguation rank instead of a file
233 fromRank = rank_from_char(c);
239 if (state == TO_RANK)
241 // Previous file was for disambiguation, or it's a pawn capture
245 else if (state != TO_FILE)
249 if (state == PROMOTION_OR_CHECK)
255 if (state == PROMOTION_OR_CHECK || state == CHECK)
269 // Look for a matching move
270 Move m, move = MOVE_NONE;
271 to = make_square(toFile, toRank);
274 while ((m = mp.get_next_move()) != MOVE_NONE)
275 if ( pos.type_of_piece_on(move_from(m)) == pt
277 && move_promotion_piece(m) == promotion
278 && (fromFile == FILE_NONE || fromFile == square_file(move_from(m)))
279 && (fromRank == RANK_NONE || fromRank == square_rank(move_from(m))))
284 return (matches == 1 ? move : MOVE_NONE);
288 /// line_to_san() takes a position and a line (an array of moves representing
289 /// a sequence of legal moves from the position) as input, and returns a
290 /// string containing the line in short algebraic notation. If the boolean
291 /// parameter 'breakLines' is true, line breaks are inserted, with a line
292 /// length of 80 characters. After a line break, 'startColumn' spaces are
293 /// inserted at the beginning of the new line.
295 const string line_to_san(const Position& pos, Move line[], int startColumn, bool breakLines) {
301 size_t maxLength = 80 - startColumn;
302 Position p(pos, pos.thread());
304 for (int i = 0; line[i] != MOVE_NONE; i++)
306 moveStr = move_to_san(p, line[i]);
307 length += moveStr.length() + 1;
308 if (breakLines && length > maxLength)
310 s << '\n' << std::setw(startColumn) << ' ';
311 length = moveStr.length() + 1;
315 if (line[i] == MOVE_NULL)
318 p.do_move(line[i], st);
324 /// pretty_pv() creates a human-readable string from a position and a PV.
325 /// It is used to write search information to the log file (which is created
326 /// when the UCI parameter "Use Search Log" is "true").
328 const string pretty_pv(const Position& pos, int time, int depth,
329 uint64_t nodes, Value score, ValueType type, Move pv[]) {
333 s << std::setw(2) << depth << " ";
336 s << ((type == VALUE_TYPE_LOWER)? ">" : ((type == VALUE_TYPE_UPPER)? "<" : " "));
337 s << std::setw(7) << score_string(score);
340 s << std::setw(8) << time_string(time) << " ";
343 if (nodes < 1000000ULL)
344 s << std::setw(8) << nodes << " ";
345 else if (nodes < 1000000000ULL)
346 s << std::setw(7) << nodes/1000ULL << 'k' << " ";
348 s << std::setw(7) << nodes/1000000ULL << 'M' << " ";
351 s << line_to_san(pos, pv, 30, true);
359 Ambiguity move_ambiguity(const Position& pos, Move m) {
361 Square from = move_from(m);
362 Square to = move_to(m);
363 Piece pc = pos.piece_on(from);
365 // King moves are never ambiguous, because there is never two kings of
367 if (type_of_piece(pc) == KING)
368 return AMBIGUITY_NONE;
370 MovePicker mp = MovePicker(pos, MOVE_NONE, OnePly, H);
371 Bitboard pinned = pos.pinned_pieces(pos.side_to_move());
372 Move mv, moveList[8];
375 while ((mv = mp.get_next_move()) != MOVE_NONE)
376 if (move_to(mv) == to && pos.piece_on(move_from(mv)) == pc && pos.pl_move_is_legal(mv, pinned))
380 return AMBIGUITY_NONE;
383 for (int i = 0; i < n; i++)
385 if (square_file(move_from(moveList[i])) == square_file(from))
388 if (square_rank(move_from(moveList[i])) == square_rank(from))
392 return AMBIGUITY_FILE;
395 return AMBIGUITY_RANK;
397 return AMBIGUITY_BOTH;
401 const string time_string(int milliseconds) {
404 s << std::setfill('0');
406 int hours = milliseconds / (1000*60*60);
407 int minutes = (milliseconds - hours*1000*60*60) / (1000*60);
408 int seconds = (milliseconds - hours*1000*60*60 - minutes*1000*60) / 1000;
413 s << std::setw(2) << minutes << ':' << std::setw(2) << seconds;
418 const string score_string(Value v) {
422 if (v >= VALUE_MATE - 200)
423 s << "#" << (VALUE_MATE - v + 1) / 2;
424 else if(v <= -VALUE_MATE + 200)
425 s << "-#" << (VALUE_MATE + v) / 2;
428 float floatScore = float(v) / float(PawnValueMidgame);
432 s << std::setprecision(2) << std::fixed << floatScore;