X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmain.cpp;h=a5ed56ec3b77cba9d195e24ed705c0c18793f5b2;hp=1a8309700555bfd61ef916fad97619d48d50386f;hb=678d7c5c411d6f2f120b7735d292df1d3c66c601;hpb=5c5af4fa6533e22fb56dd22985cf2b3938efde6c diff --git a/src/main.cpp b/src/main.cpp index 1a830970..a5ed56ec 100644 --- a/src/main.cpp +++ b/src/main.cpp @@ -1,7 +1,8 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, 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 @@ -18,46 +19,165 @@ */ #include -#include +#include #include "bitboard.h" -#include "evaluate.h" #include "position.h" -#include "thread.h" #include "search.h" -#include "ucioption.h" +#include "thread.h" +#include "tt.h" +#include "uci.h" +#include "syzygy/tbprobe.h" + +#include +#include +#include +#include "hashprobe.grpc.pb.h" + +using grpc::Server; +using grpc::ServerBuilder; +using grpc::ServerContext; +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"); + } + + bool invert = (pos.side_to_move() == BLACK); + Search::StateStackPtr setup_states = Search::StateStackPtr(new std::stack); + + ProbeMove(&pos, setup_states.get(), invert, response->mutable_root()); + + MoveList moves(pos); + for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) { + HashProbeLine *line = response->add_line(); + FillMove(em->move, line->mutable_move()); + setup_states->push(StateInfo()); + pos.do_move(em->move, setup_states->top(), pos.gives_check(em->move, CheckInfo(pos))); + ProbeMove(&pos, setup_states.get(), !invert, line); + pos.undo_move(em->move); + } + + return Status::OK; + } + + void FillMove(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)); + } + + decoded->set_from_sq(UCI::square(from)); + decoded->set_to_sq(UCI::square(to)); -using namespace std; + if (type_of(move) == PROMOTION) { + decoded->set_promotion(std::string() + " PNBRQK"[promotion_type(move)]); + } + } -extern void uci_loop(); -extern void benchmark(int argc, char* argv[]); -extern void kpk_bitbase_init(); + void ProbeMove(Position* pos, std::stack* 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()); + 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())) { + FillMove(entry->move(), response->add_pv()); + if (seen.count(pos->key())) break; + pv.push(entry->move()); + seen.insert(pos->key()); + setup_states->push(StateInfo()); + pos->do_move(entry->move(), setup_states->top(), pos->gives_check(entry->move(), CheckInfo(*pos))); + 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 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); + } + } +}; + +void rpc_thread() +{ + std::string server_address("0.0.0.0:50051"); + HashProbeImpl service; + + ServerBuilder builder; + builder.AddListeningPort(server_address, grpc::InsecureServerCredentials()); + builder.RegisterService(&service); + std::unique_ptr server(builder.BuildAndStart()); + std::cout << "Server listening on " << server_address << std::endl; + server->Wait(); +} + +namespace PSQT { + void init(); +} int main(int argc, char* argv[]) { - bitboards_init(); + std::cout << engine_info() << std::endl; + + UCI::init(Options); + PSQT::init(); + Bitboards::init(); Position::init(); - kpk_bitbase_init(); + Bitbases::init(); Search::init(); - Threads.init(); - - if (argc < 2) - { - cout << engine_name() << " by " << engine_authors() << endl; - - if (CpuHasPOPCNT) - cout << "Good! CPU has hardware POPCNT." << endl; + Pawns::init(); + Threads.set(Options["Threads"]); + Search::clear(); // After threads are up - uci_loop(); // Enter the UCI loop and wait for user input - } - else if (string(argv[1]) == "bench") - benchmark(argc, argv); + std::thread(&rpc_thread).detach(); - else - cout << "Usage: stockfish bench [hash size = 128] [threads = 1] " - << "[limit = 12] [fen positions file = default] " - << "[limited by depth, time, nodes or perft = depth]" << endl; + UCI::loop(argc, argv); - Threads.exit(); + Threads.set(0); return 0; }