X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmain.cpp;h=a2c741e53e2e4bd0f9bbfa458d6ceb69932a909f;hp=76aca51d2e8f5f13d8178029ab1f4427bbdab0d3;hb=699bae632f283746a3eee15c0950fcdbca8a355e;hpb=26bd29e45bea7c756550c3c8130ac64ba71375de diff --git a/src/main.cpp b/src/main.cpp index 76aca51d..a2c741e5 100644 --- a/src/main.cpp +++ b/src/main.cpp @@ -1,8 +1,6 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 - Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad - Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad + Copyright (C) 2004-2021 The Stockfish developers (see AUTHORS file) Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -24,18 +22,21 @@ #include #include "bitboard.h" +#include "endgame.h" #include "position.h" +#include "psqt.h" #include "search.h" +#include "syzygy/tbprobe.h" #include "thread.h" #include "tt.h" #include "uci.h" -#include "syzygy/tbprobe.h" #include #include #include #include "hashprobe.h" #include "hashprobe.grpc.pb.h" +#include "tt.h" using grpc::Server; using grpc::ServerBuilder; @@ -62,9 +63,9 @@ Status HashProbeImpl::Probe(ServerContext* context, MoveList moves(pos); for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) { HashProbeLine *line = response->add_line(); - FillMove(em->move, line->mutable_move()); + FillMove(&pos, em->move, line->mutable_move()); setup_states->push_back(StateInfo()); - pos.do_move(em->move, setup_states->back(), pos.gives_check(em->move)); + pos.do_move(em->move, setup_states->back()); ProbeMove(&pos, setup_states.get(), !invert, line); pos.undo_move(em->move); } @@ -72,7 +73,7 @@ Status HashProbeImpl::Probe(ServerContext* context, return Status::OK; } -void HashProbeImpl::FillMove(Move move, HashProbeMove* decoded) { +void HashProbeImpl::FillMove(Position *pos, Move move, HashProbeMove* decoded) { if (!is_ok(move)) return; Square from = from_sq(move); @@ -81,13 +82,73 @@ void HashProbeImpl::FillMove(Move move, HashProbeMove* decoded) { if (type_of(move) == CASTLING) { to = make_square(to > from ? FILE_G : FILE_C, rank_of(from)); } - - decoded->set_from_sq(UCI::square(from)); - decoded->set_to_sq(UCI::square(to)); - if (type_of(move) == PROMOTION) { - decoded->set_promotion(std::string() + " PNBRQK"[promotion_type(move)]); + Piece moved_piece = pos->moved_piece(move); + std::string pretty; + if (type_of(move) == CASTLING) { + if (to > from) { + pretty = "O-O"; + } else { + pretty = "O-O-O"; + } + } else if (type_of(moved_piece) == PAWN) { + if (type_of(move) == ENPASSANT || pos->piece_on(to) != NO_PIECE) { + // Capture. + pretty = char('a' + file_of(from)); + pretty += "x"; + } + pretty += UCI::square(to); + if (type_of(move) == PROMOTION) { + pretty += "="; + pretty += " PNBRQK"[promotion_type(move)]; + } + } else { + pretty = " PNBRQK"[type_of(moved_piece)]; + Bitboard attackers = pos->attackers_to(to) & pos->pieces(color_of(moved_piece), type_of(moved_piece)); + if (more_than_one(attackers)) { + // Remove all illegal moves to disambiguate. + Bitboard att_copy = attackers; + while (att_copy) { + Square s = pop_lsb(&att_copy); + Move m = make_move(s, to); + if (!pos->pseudo_legal(m) || !pos->legal(m)) { + attackers &= ~SquareBB[s]; + } + } + } + if (more_than_one(attackers)) { + // Disambiguate by file if possible. + Bitboard attackers_this_file = attackers & file_bb(file_of(from)); + if (attackers != attackers_this_file) { + pretty += char('a' + file_of(from)); + attackers = attackers_this_file; + } + if (more_than_one(attackers)) { + // Still ambiguous, so need to disambiguate by rank. + pretty += char('1' + rank_of(from)); + } + } + + if (type_of(move) == ENPASSANT || pos->piece_on(to) != NO_PIECE) { + pretty += "x"; + } + + pretty += UCI::square(to); } + + if (pos->gives_check(move)) { + // Check if mate. + StateInfo si; + pos->do_move(move, si, true); + if (MoveList(*pos).size() > 0) { + pretty += "+"; + } else { + pretty += "#"; + } + pos->undo_move(move); + } + + decoded->set_pretty(pretty); } void HashProbeImpl::ProbeMove(Position* pos, std::deque* setup_states, bool invert, HashProbeLine* response) { @@ -122,12 +183,12 @@ void HashProbeImpl::ProbeMove(Position* pos, std::deque* setup_states while (found && is_ok(entry->move()) && pos->pseudo_legal(entry->move()) && pos->legal(entry->move())) { - FillMove(entry->move(), response->add_pv()); + FillMove(pos, entry->move(), response->add_pv()); if (seen.count(pos->key())) break; pv.push(entry->move()); seen.insert(pos->key()); setup_states->push_back(StateInfo()); - pos->do_move(entry->move(), setup_states->back(), pos->gives_check(entry->move())); + pos->do_move(entry->move(), setup_states->back()); entry = TT.probe(pos->key(), found); } @@ -165,19 +226,23 @@ namespace PSQT { void init(); } +using namespace Stockfish; + int main(int argc, char* argv[]) { std::cout << engine_info() << std::endl; + CommandLine::init(argc, argv); UCI::init(Options); + Tune::init(); PSQT::init(); Bitboards::init(); Position::init(); Bitbases::init(); - Search::init(); - Pawns::init(); - Threads.set(Options["Threads"]); + Endgames::init(); + Threads.set(size_t(Options["Threads"])); Search::clear(); // After threads are up + Eval::NNUE::init(); UCI::loop(argc, argv);