const std::string move_to_uci(Move m, bool chess960) {
- std::string str;
+ std::string promotion;
Square from = move_from(m);
Square to = move_to(m);
if (move_is_long_castle(m) && !chess960)
return from == SQ_E1 ? "e1c1" : "e8c8";
- str = square_to_string(from) + square_to_string(to);
-
if (move_is_promotion(m))
- str += char(tolower(piece_type_to_char(move_promotion_piece(m))));
+ promotion = char(tolower(piece_type_to_char(move_promotion_piece(m))));
- return str;
+ return square_to_string(from) + square_to_string(to) + promotion;
}
-/// move_from_uci() takes a position and a string as input, and attempts to
-/// convert the string to a move, using simple coordinate notation (g1f3,
-/// a7a8q, etc.). This function is not robust, and expects that the input
-/// move is legal and correctly formatted.
-
-Move move_from_uci(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 = make_square(file_from_char(str[0]), rank_from_char(str[1]));
- to = make_square(file_from_char(str[2]), rank_from_char(str[3]));
-
- // 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 (str.length() > 4 && piece == piece_of_color_and_type(us, PAWN))
- {
- switch (tolower(str[4])) {
- case 'n':
- return make_promotion_move(from, to, KNIGHT);
- case 'b':
- return make_promotion_move(from, to, BISHOP);
- case 'r':
- return make_promotion_move(from, to, ROOK);
- case 'q':
- return make_promotion_move(from, to, QUEEN);
- }
- }
-
- // En passant move? We assume that a pawn move is an en passant move
- // if the destination square is epSquare.
- if (to == pos.ep_square() && piece == piece_of_color_and_type(us, PAWN))
- return make_ep_move(from, to);
+/// move_from_uci() takes a position and a string representing a move in
+/// simple coordinate notation and returns an equivalent Move.
- // 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 (piece == piece_of_color_and_type(us, KING))
- {
- if (pos.piece_on(to) == piece_of_color_and_type(us, ROOK))
- return make_castle_move(from, to);
-
- 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 = from;
+Move move_from_uci(const Position& pos, const std::string& str) {
- do s += delta;
- while ( pos.piece_on(s) != piece_of_color_and_type(us, ROOK)
- && relative_rank(us, s) == RANK_1);
+ MoveStack mlist[MOVES_MAX];
+ MoveStack* last = generate<MV_LEGAL>(pos, mlist);
- return relative_rank(us, s) == RANK_1 ? make_castle_move(from, s) : MOVE_NONE;
- }
- }
+ for (MoveStack* cur = mlist; cur != last; cur++)
+ if (str == move_to_uci(cur->move, pos.is_chess960()))
+ return cur->move;
- return make_move(from, to);
+ return MOVE_NONE;
}
}
-/// move_from_san() takes a position and a string as input, and tries to
-/// interpret the string as a move in short algebraic notation. On success,
-/// the move is returned. On failure (i.e. if the string is unparsable, or
-/// if the move is illegal or ambiguous), MOVE_NONE is returned.
-
-Move move_from_san(const Position& pos, const string& movestr) {
-
- assert(pos.is_ok());
-
- enum { START, TO_FILE, TO_RANK, PROMOTION_OR_CHECK, PROMOTION, CHECK, END };
- static const string pieceLetters = "KQRBN";
-
- MoveStack mlist[MOVES_MAX], *last;
- PieceType pt = PIECE_TYPE_NONE, promotion = PIECE_TYPE_NONE;
- File fromFile = FILE_NONE, toFile = FILE_NONE;
- Rank fromRank = RANK_NONE, toRank = RANK_NONE;
- Move move = MOVE_NONE;
- Square from, to;
- int matches, state = START;
-
- // Generate all legal moves for the given position
- last = generate<MV_LEGAL>(pos, mlist);
-
- // Castling moves
- if (movestr == "O-O-O" || movestr == "O-O-O+")
- {
- for (MoveStack* cur = mlist; cur != last; cur++)
- if (move_is_long_castle(cur->move))
- return cur->move;
-
- return MOVE_NONE;
- }
- else if (movestr == "O-O" || movestr == "O-O+")
- {
- for (MoveStack* cur = mlist; cur != last; cur++)
- if (move_is_short_castle(cur->move))
- return cur->move;
-
- return MOVE_NONE;
- }
-
- // Normal moves. We use a simple FSM to parse the san string
- for (size_t i = 0; i < movestr.length(); i++)
- {
- char type, c = movestr[i];
-
- if (pieceLetters.find(c) != string::npos)
- type = 'P';
- else if (c >= 'a' && c <= 'h')
- type = 'F';
- else if (c >= '1' && c <= '8')
- type = 'R';
- else
- type = c;
-
- switch (type) {
- case 'P':
- if (state == START)
- {
- pt = piece_type_from_char(c);
- state = TO_FILE;
- }
- else if (state == PROMOTION)
- {
- promotion = piece_type_from_char(c);
- state = (i < movestr.length() - 1 ? CHECK : END);
- }
- else
- return MOVE_NONE;
- break;
- case 'F':
- if (state == START)
- {
- pt = PAWN;
- fromFile = toFile = file_from_char(c);
- state = TO_RANK;
- }
- else if (state == TO_FILE)
- {
- toFile = file_from_char(c);
- state = TO_RANK;
- }
- else if (state == TO_RANK && toFile != FILE_NONE)
- {
- // Previous file was for disambiguation
- fromFile = toFile;
- toFile = file_from_char(c);
- }
- else
- return MOVE_NONE;
- break;
- case 'R':
- if (state == TO_RANK)
- {
- toRank = rank_from_char(c);
- state = (i < movestr.length() - 1) ? PROMOTION_OR_CHECK : END;
- }
- else if (state == TO_FILE && fromRank == RANK_NONE)
- {
- // It's a disambiguation rank instead of a file
- fromRank = rank_from_char(c);
- }
- else
- return MOVE_NONE;
- break;
- case 'x':
- case 'X':
- if (state == TO_RANK)
- {
- // Previous file was for disambiguation, or it's a pawn capture
- fromFile = toFile;
- state = TO_FILE;
- }
- else if (state != TO_FILE)
- return MOVE_NONE;
- break;
- case '=':
- if (state == PROMOTION_OR_CHECK)
- state = PROMOTION;
- else
- return MOVE_NONE;
- break;
- case '+':
- case '#':
- if (state == PROMOTION_OR_CHECK || state == CHECK)
- state = END;
- else
- return MOVE_NONE;
- break;
- default:
- return MOVE_NONE;
- break;
- }
- }
-
- if (state != END)
- return MOVE_NONE;
-
- // Look for an unambiguous matching move
- to = make_square(toFile, toRank);
- matches = 0;
-
- for (MoveStack* cur = mlist; cur != last; cur++)
- {
- from = move_from(cur->move);
-
- if ( pos.type_of_piece_on(from) == pt
- && move_to(cur->move) == to
- && move_promotion_piece(cur->move) == promotion
- && (fromFile == FILE_NONE || fromFile == square_file(from))
- && (fromRank == RANK_NONE || fromRank == square_rank(from)))
- {
- move = cur->move;
- matches++;
- }
- }
- return matches == 1 ? move : MOVE_NONE;
-}
-
-
/// line_to_san() takes a position and a line (an array of moves representing
/// a sequence of legal moves from the position) as input, and returns a
/// string containing the line in short algebraic notation. If the boolean
projects / stockfish / blobdiff