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/>.
30 /// move_to_uci() converts a move to a string in coordinate notation
31 /// (g1f3, a7a8q, etc.). The only special case is castling moves, where we
32 /// print in the e1g1 notation in normal chess mode, and in e1h1 notation in
33 /// Chess960 mode. Instead internally Move is coded as "king captures rook".
35 const string move_to_uci(Move m, bool chess960) {
37 Square from = move_from(m);
38 Square to = move_to(m);
47 if (is_castle(m) && !chess960)
48 to = from + (file_of(to) == FILE_H ? Square(2) : -Square(2));
51 promotion = char(tolower(piece_type_to_char(promotion_piece_type(m))));
53 return square_to_string(from) + square_to_string(to) + promotion;
57 /// move_from_uci() takes a position and a string representing a move in
58 /// simple coordinate notation and returns an equivalent Move if any.
59 /// Moves are guaranteed to be legal.
61 Move move_from_uci(const Position& pos, const string& str) {
63 for (MoveList<MV_LEGAL> ml(pos); !ml.end(); ++ml)
64 if (str == move_to_uci(ml.move(), pos.is_chess960()))
71 /// move_to_san() takes a position and a move as input, where it is assumed
72 /// that the move is a legal move for the position. The return value is
73 /// a string containing the move in short algebraic notation.
75 const string move_to_san(Position& pos, Move m) {
86 bool ambiguousMove, ambiguousFile, ambiguousRank;
87 Square sq, from = move_from(m);
88 Square to = move_to(m);
89 PieceType pt = type_of(pos.piece_on(from));
93 san = (move_to(m) < move_from(m) ? "O-O-O" : "O-O");
98 san = piece_type_to_char(pt);
100 // Disambiguation if we have more then one piece with destination 'to'
101 // note that for pawns is not needed because starting file is explicit.
102 attackers = pos.attackers_to(to) & pos.pieces(pt, pos.side_to_move());
103 clear_bit(&attackers, from);
104 ambiguousMove = ambiguousFile = ambiguousRank = false;
108 sq = pop_1st_bit(&attackers);
110 if (file_of(sq) == file_of(from))
111 ambiguousFile = true;
113 if (rank_of(sq) == rank_of(from))
114 ambiguousRank = true;
116 ambiguousMove = true;
122 san += file_to_char(file_of(from));
123 else if (!ambiguousRank)
124 san += rank_to_char(rank_of(from));
126 san += square_to_string(from);
130 if (pos.is_capture(m))
133 san += file_to_char(file_of(from));
138 san += square_to_string(to);
143 san += piece_type_to_char(promotion_piece_type(m));
147 // The move gives check? We don't use pos.move_gives_check() here
148 // because we need to test for a mate after the move is done.
152 san += pos.is_mate() ? "#" : "+";