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 print
30 /// in the e1g1 notation in normal chess mode, and in e1h1 notation in chess960
31 /// mode. Internally castle moves are always coded as "king captures rook".
33 const string move_to_uci(Move m, bool chess960) {
35 Square from = from_sq(m);
44 if (type_of(m) == CASTLE && !chess960)
45 to = (to > from ? FILE_G : FILE_C) | rank_of(from);
47 string move = square_to_string(from) + square_to_string(to);
49 if (type_of(m) == PROMOTION)
50 move += char(tolower(piece_type_to_char(promotion_type(m))));
56 /// move_from_uci() takes a position and a string representing a move in
57 /// simple coordinate notation and returns an equivalent legal Move if any.
59 Move move_from_uci(const Position& pos, string& str) {
61 if (str.length() == 5) // Junior could send promotion piece in uppercase
62 str[4] = char(tolower(str[4]));
64 for (MoveList<LEGAL> ml(pos); !ml.end(); ++ml)
65 if (str == move_to_uci(ml.move(), pos.is_chess960()))
72 /// move_to_san() takes a position and a legal Move as input and returns its
73 /// short algebraic notation representation.
75 const string move_to_san(Position& pos, Move m) {
83 assert(pos.move_is_legal(m));
86 bool ambiguousMove, ambiguousFile, ambiguousRank;
88 Square from = from_sq(m);
90 PieceType pt = type_of(pos.piece_on(from));
92 if (type_of(m) == CASTLE)
93 san = to > from ? "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(pos.side_to_move(), pt);
104 ambiguousMove = ambiguousFile = ambiguousRank = false;
108 Square sq = pop_1st_bit(&attackers);
110 // Pinned pieces are not included in the possible sub-set
111 if (!pos.pl_move_is_legal(make_move(sq, to), pos.pinned_pieces()))
114 ambiguousFile |= file_of(sq) == file_of(from);
115 ambiguousRank |= rank_of(sq) == rank_of(from);
116 ambiguousMove = true;
122 san += file_to_char(file_of(from));
124 else if (!ambiguousRank)
125 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);
142 if (type_of(m) == PROMOTION)
143 san += string("=") + piece_type_to_char(promotion_type(m));
146 if (pos.move_gives_check(m, CheckInfo(pos)))
150 san += MoveList<LEGAL>(pos).size() ? "+" : "#";