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-2012 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/>.
28 /// move_to_uci() converts a move to a string in coordinate notation
29 /// (g1f3, a7a8q, etc.). The only special case is castling moves, where we
30 /// print in the e1g1 notation in normal chess mode, and in e1h1 notation in
31 /// Chess960 mode. Instead internally Move is coded as "king captures rook".
33 const string move_to_uci(Move m, bool chess960) {
35 Square from = from_sq(m);
45 if (is_castle(m) && !chess960)
46 to = from + (file_of(to) == FILE_H ? Square(2) : -Square(2));
49 promotion = char(tolower(piece_type_to_char(promotion_piece_type(m))));
51 return square_to_string(from) + square_to_string(to) + promotion;
55 /// move_from_uci() takes a position and a string representing a move in
56 /// simple coordinate notation and returns an equivalent Move if any.
57 /// Moves are guaranteed to be legal.
59 Move move_from_uci(const Position& pos, const string& str) {
61 for (MoveList<MV_LEGAL> ml(pos); !ml.end(); ++ml)
62 if (str == move_to_uci(ml.move(), pos.is_chess960()))
69 /// move_to_san() takes a position and a move as input, where it is assumed
70 /// that the move is a legal move for the position. The return value is
71 /// a string containing the move in short algebraic notation.
73 const string move_to_san(Position& pos, Move m) {
84 bool ambiguousMove, ambiguousFile, ambiguousRank;
85 Square sq, from = from_sq(m);
87 PieceType pt = type_of(pos.piece_on(from));
91 san = (to_sq(m) < from_sq(m) ? "O-O-O" : "O-O");
96 san = piece_type_to_char(pt);
98 // Disambiguation if we have more then one piece with destination 'to'
99 // note that for pawns is not needed because starting file is explicit.
100 attackers = pos.attackers_to(to) & pos.pieces(pt, pos.side_to_move());
101 xor_bit(&attackers, from);
102 ambiguousMove = ambiguousFile = ambiguousRank = false;
106 sq = pop_1st_bit(&attackers);
108 // Pinned pieces are not included in the possible sub-set
109 if (!pos.pl_move_is_legal(make_move(sq, to), pos.pinned_pieces()))
112 if (file_of(sq) == file_of(from))
113 ambiguousFile = true;
115 if (rank_of(sq) == rank_of(from))
116 ambiguousRank = true;
118 ambiguousMove = true;
124 san += file_to_char(file_of(from));
125 else if (!ambiguousRank)
126 san += rank_to_char(rank_of(from));
128 san += square_to_string(from);
132 if (pos.is_capture(m))
135 san += file_to_char(file_of(from));
140 san += square_to_string(to);
145 san += piece_type_to_char(promotion_piece_type(m));
149 if (pos.move_gives_check(m, CheckInfo(pos)))
153 san += MoveList<MV_LEGAL>(pos).size() ? "+" : "#";