X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmain.cpp;h=a62c3a8562ebb929ccf0a4029c405ab768410f94;hp=0d94cd43ff4686726e8f9c167e57dde52934723b;hb=2c097c81268e083f472bccfb47ecf56db3e3853e;hpb=f79be3fae1b51614fb9f0102a5e475e687bd6e0f diff --git a/src/main.cpp b/src/main.cpp index 0d94cd43..a62c3a85 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-2020 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 @@ -18,10 +16,13 @@ along with this program. If not, see . */ +#include #include +#include #include #include "bitboard.h" +#include "endgame.h" #include "position.h" #include "search.h" #include "thread.h" @@ -32,7 +33,9 @@ #include #include #include +#include "hashprobe.h" #include "hashprobe.grpc.pb.h" +#include "tt.h" using grpc::Server; using grpc::ServerBuilder; @@ -41,71 +44,181 @@ using grpc::Status; using grpc::StatusCode; using namespace hashprobe; -class HashProbeImpl final : public HashProbe::Service { -public: - Status Probe(ServerContext* context, - const HashProbeRequest* request, - HashProbeResponse *response) { - Position pos(request->fen(), /*isChess960=*/false, Threads.main()); - if (!pos.pos_is_ok()) { - return Status(StatusCode::INVALID_ARGUMENT, "Invalid FEN"); - } +Status HashProbeImpl::Probe(ServerContext* context, + const HashProbeRequest* request, + HashProbeResponse *response) { + Position pos; + StateInfo st; + pos.set(request->fen(), /*isChess960=*/false, &st, Threads.main()); + if (!pos.pos_is_ok()) { + return Status(StatusCode::INVALID_ARGUMENT, "Invalid FEN"); + } - bool invert = (pos.side_to_move() == BLACK); + bool invert = (pos.side_to_move() == BLACK); + StateListPtr setup_states = StateListPtr(new std::deque(1)); - HashProbeMove *root_move = response->add_move(); - root_move->set_move(MOVE_NONE); - ProbeMove(pos.key(), invert, root_move); + ProbeMove(&pos, setup_states.get(), invert, response->mutable_root()); - MoveList moves(pos); - for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) { - HashProbeMove *move = response->add_move(); - move->set_move(em->move); - ProbeMove(pos.key_after(em->move), !invert, move); - } + MoveList moves(pos); + for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) { + HashProbeLine *line = response->add_line(); + FillMove(&pos, em->move, line->mutable_move()); + setup_states->push_back(StateInfo()); + pos.do_move(em->move, setup_states->back()); + ProbeMove(&pos, setup_states.get(), !invert, line); + pos.undo_move(em->move); + } - return Status::OK; + return Status::OK; +} + +void HashProbeImpl::FillMove(Position *pos, Move move, HashProbeMove* decoded) { + if (!is_ok(move)) return; + + Square from = from_sq(move); + Square to = to_sq(move); + + if (type_of(move) == CASTLING) { + to = make_square(to > from ? FILE_G : FILE_C, rank_of(from)); } - void ProbeMove(const int64_t key, bool invert, HashProbeMove* response) { - bool found; - TTEntry *entry = TT.probe(key, found); - response->set_found(found); - if (found) { - Value value = entry->value(); - Value eval = entry->eval(); - Bound bound = entry->bound(); - - if (invert) { - value = -value; - eval = -eval; - if (bound == BOUND_UPPER) { - bound = BOUND_LOWER; - } else if (bound == BOUND_LOWER) { - bound = BOUND_UPPER; + 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); + } - response->set_pv_move(entry->move()); - response->set_depth(entry->depth()); - response->set_eval(eval); - response->set_value(value); - response->set_bound(HashProbeMove::ValueBound(bound)); + 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); } -}; - -void rpc_thread() -{ - std::string server_address("0.0.0.0:50051"); - HashProbeImpl service; - - ServerBuilder builder; + + decoded->set_pretty(pretty); +} + +void HashProbeImpl::ProbeMove(Position* pos, std::deque* setup_states, bool invert, HashProbeLine* response) { + bool found; + TTEntry *entry = TT.probe(pos->key(), found); + response->set_found(found); + if (found) { + Value value = entry->value(); + Value eval = entry->eval(); + Bound bound = entry->bound(); + + if (invert) { + value = -value; + eval = -eval; + if (bound == BOUND_UPPER) { + bound = BOUND_LOWER; + } else if (bound == BOUND_LOWER) { + bound = BOUND_UPPER; + } + } + + response->set_depth(entry->depth()); + FillValue(eval, response->mutable_eval()); + if (entry->depth() > DEPTH_NONE) { + FillValue(value, response->mutable_value()); + } + response->set_bound(HashProbeLine::ValueBound(bound)); + + // Follow the PV until we hit an illegal move. + std::stack pv; + std::set seen; + while (found && is_ok(entry->move()) && + pos->pseudo_legal(entry->move()) && + pos->legal(entry->move())) { + 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()); + entry = TT.probe(pos->key(), found); + } + + // Unroll the PV back again, so the Position object remains unchanged. + while (!pv.empty()) { + pos->undo_move(pv.top()); + pv.pop(); + } + } +} + +void HashProbeImpl::FillValue(Value value, HashProbeScore* score) { + if (abs(value) < VALUE_MATE - MAX_PLY) { + score->set_score_type(HashProbeScore::SCORE_CP); + score->set_score_cp(value * 100 / PawnValueEg); + } else { + score->set_score_type(HashProbeScore::SCORE_MATE); + score->set_score_mate((value > 0 ? VALUE_MATE - value + 1 : -VALUE_MATE - value) / 2); + } +} + +HashProbeThread::HashProbeThread(const std::string &server_address) { builder.AddListeningPort(server_address, grpc::InsecureServerCredentials()); builder.RegisterService(&service); - std::unique_ptr server(builder.BuildAndStart()); + server = std::move(builder.BuildAndStart()); std::cout << "Server listening on " << server_address << std::endl; - server->Wait(); + std::thread([this]{ server->Wait(); }).detach(); +} + +void HashProbeThread::Shutdown() { + server->Shutdown(); } namespace PSQT { @@ -116,17 +229,17 @@ 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 - - std::thread(&rpc_thread).detach(); + Eval::init_NNUE(); UCI::loop(argc, argv);