X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmove.cpp;h=41d1603771a7b4d7d29daa019c23667deff99272;hp=f23fcbe021796f086fe9cadf9fd5479f8f4f9773;hb=9c7e2c8f9d3eba45c20529ad0624e6de10fc7b83;hpb=d3600c39a745179ed6b094b305d0645e83a1ee86 diff --git a/src/move.cpp b/src/move.cpp index f23fcbe0..41d16037 100644 --- a/src/move.cpp +++ b/src/move.cpp @@ -1,148 +1,154 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008 Marco Costalba + Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. - + Stockfish is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. - + You should have received a copy of the GNU General Public License along with this program. If not, see . */ - -//// -//// Includes -//// - #include +#include -#include "move.h" -#include "piece.h" +#include "movegen.h" #include "position.h" -#include "ucioption.h" - - -//// -//// Functions -//// - -/// move_from_string() takes a position and a string as input, and attempts to -/// convert the string to a move, using simple coordinate notation (g1f3, -/// a7a8q, etc.). In order to correctly parse en passant captures and castling -/// moves, we need the position. This function is not robust, and expects that -/// the input move is legal and correctly formatted. - -Move move_from_string(const Position &pos, const std::string &str) { - Square from, to; - Piece piece; - Color us = pos.side_to_move(); - - if(str.length() < 4) return MOVE_NONE; - - // Read the from and to squares: - from = square_from_string(str.substr(0, 2)); - to = square_from_string(str.substr(2, 4)); - - // Find the moving piece: - piece = pos.piece_on(from); - - // If the string has more than 4 characters, try to interpret the 5th - // character as a promotion: - if(type_of_piece(piece) == PAWN && str.length() >= 5) { - switch(str[4]) { - case 'n': case 'N': - return make_promotion_move(from, to, KNIGHT); - case 'b': case 'B': - return make_promotion_move(from, to, BISHOP); - case 'r': case 'R': - return make_promotion_move(from, to, ROOK); - case 'q': case 'Q': - return make_promotion_move(from, to, QUEEN); - } - } - if(piece == king_of_color(us)) { - // Is this a castling move? A king move is assumed to be a castling - // move if the destination square is occupied by a friendly rook, or - // if the distance between the source and destination squares is more - // than 1. - if(pos.piece_on(to) == rook_of_color(us)) - return make_castle_move(from, to); - else if(square_distance(from, to) > 1) { - // This is a castling move, but we have to translate it to the - // internal "king captures rook" representation. - SquareDelta delta = (to > from)? DELTA_E : DELTA_W; - Square s; - for(s = from + delta; - relative_rank(us, s) == RANK_1 && pos.piece_on(s) != rook_of_color(us); - s += delta); - if(relative_rank(us, s) == RANK_1 && pos.piece_on(s) == rook_of_color(us)) - return make_castle_move(from, s); - } - } - else if(piece == pawn_of_color(us)) { - // En passant move? We assume that a pawn move is an en passant move - // without further testing if the destination square is epSquare. - if(to == pos.ep_square()) - return make_ep_move(from, to); - } +using std::string; - return make_move(from, to); -} +/// move_to_uci() converts a move to a string in coordinate notation +/// (g1f3, a7a8q, etc.). The only special case is castling moves, where we print +/// in the e1g1 notation in normal chess mode, and in e1h1 notation in chess960 +/// mode. Internally castle moves are always coded as "king captures rook". +const string move_to_uci(Move m, bool chess960) { -/// move_to_string() converts a move to a string in coordinate notation -/// (g1f3, a7a8q, etc.). The only special case is castling moves, where we -/// print in the e1g1 notation in normal chess mode, and in e1h1 notation in -/// Chess960 mode. + Square from = from_sq(m); + Square to = to_sq(m); + string promotion; -const std::string move_to_string(Move move) { - std::string str; + if (m == MOVE_NONE) + return "(none)"; - if(move == MOVE_NONE) - str = "(none)"; - else if(move == MOVE_NULL) - str = "0000"; - else { - if(!Chess960) { - if(move_from(move) == SQ_E1 && move_is_short_castle(move)) { - str = "e1g1"; return str; - } - else if(move_from(move) == SQ_E1 && move_is_long_castle(move)) { - str = "e1c1"; return str; - } - if(move_from(move) == SQ_E8 && move_is_short_castle(move)) { - str = "e8g8"; return str; - } - else if(move_from(move) == SQ_E8 && move_is_long_castle(move)) { - str = "e8c8"; return str; - } - } - str = square_to_string(move_from(move)) + square_to_string(move_to(move)); - if(move_promotion(move)) - str += piece_type_to_char(move_promotion(move), false); - } - return str; + if (m == MOVE_NULL) + return "0000"; + + if (is_castle(m) && !chess960) + to = make_square(to > from ? FILE_G : FILE_C, rank_of(from)); + + if (is_promotion(m)) + promotion = char(tolower(piece_type_to_char(promotion_type(m)))); + + return square_to_string(from) + square_to_string(to) + promotion; } -/// Overload the << operator, to make it easier to print moves. +/// move_from_uci() takes a position and a string representing a move in +/// simple coordinate notation and returns an equivalent legal Move if any. -std::ostream &operator << (std::ostream &os, Move m) { - return os << move_to_string(m); +Move move_from_uci(const Position& pos, string& str) { + + if (str.length() == 5) // Junior could send promotion piece in uppercase + str[4] = char(tolower(str[4])); + + for (MoveList ml(pos); !ml.end(); ++ml) + if (str == move_to_uci(ml.move(), pos.is_chess960())) + return ml.move(); + + return MOVE_NONE; } -/// move_is_ok(), for debugging. +/// move_to_san() takes a position and a legal Move as input and returns its +/// short algebraic notation representation. + +const string move_to_san(Position& pos, Move m) { + + if (m == MOVE_NONE) + return "(none)"; + + if (m == MOVE_NULL) + return "(null)"; + + assert(pos.move_is_legal(m)); + + Bitboard attackers; + bool ambiguousMove, ambiguousFile, ambiguousRank; + string san; + Square from = from_sq(m); + Square to = to_sq(m); + PieceType pt = type_of(pos.piece_on(from)); + + if (is_castle(m)) + san = to_sq(m) < from_sq(m) ? "O-O-O" : "O-O"; + else + { + if (pt != PAWN) + { + san = piece_type_to_char(pt); + + // Disambiguation if we have more then one piece with destination 'to' + // note that for pawns is not needed because starting file is explicit. + attackers = pos.attackers_to(to) & pos.pieces(pos.side_to_move(), pt); + attackers ^= from; + ambiguousMove = ambiguousFile = ambiguousRank = false; + + while (attackers) + { + Square sq = pop_1st_bit(&attackers); + + // Pinned pieces are not included in the possible sub-set + if (!pos.pl_move_is_legal(make_move(sq, to), pos.pinned_pieces())) + continue; + + ambiguousFile |= file_of(sq) == file_of(from); + ambiguousRank |= rank_of(sq) == rank_of(from); + ambiguousMove = true; + } + + if (ambiguousMove) + { + if (!ambiguousFile) + san += file_to_char(file_of(from)); + + else if (!ambiguousRank) + san += rank_to_char(rank_of(from)); + + else + san += square_to_string(from); + } + } + + if (pos.is_capture(m)) + { + if (pt == PAWN) + san += file_to_char(file_of(from)); + + san += 'x'; + } + + san += square_to_string(to); + + if (is_promotion(m)) + san += string("=") + piece_type_to_char(promotion_type(m)); + } + + if (pos.move_gives_check(m, CheckInfo(pos))) + { + StateInfo st; + pos.do_move(m, st); + san += MoveList(pos).size() ? "+" : "#"; + pos.undo_move(m); + } -bool move_is_ok(Move m) { - return square_is_ok(move_from(m)) && square_is_ok(move_to(m)); + return san; }