2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
5 Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
7 Stockfish is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
30 #include "syzygy/tbprobe.h"
32 #include <grpc/grpc.h>
33 #include <grpc++/server.h>
34 #include <grpc++/server_builder.h>
35 #include "hashprobe.grpc.pb.h"
38 using grpc::ServerBuilder;
39 using grpc::ServerContext;
41 using grpc::StatusCode;
42 using namespace hashprobe;
44 class HashProbeImpl final : public HashProbe::Service {
46 Status Probe(ServerContext* context,
47 const HashProbeRequest* request,
48 HashProbeResponse *response) {
49 Position pos(request->fen(), /*isChess960=*/false, Threads.main());
50 if (!pos.pos_is_ok()) {
51 return Status(StatusCode::INVALID_ARGUMENT, "Invalid FEN");
54 bool invert = (pos.side_to_move() == BLACK);
55 Search::StateStackPtr setup_states = Search::StateStackPtr(new std::stack<StateInfo>);
57 ProbeMove(&pos, setup_states.get(), invert, response->mutable_root());
59 MoveList<LEGAL> moves(pos);
60 for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) {
61 HashProbeLine *line = response->add_line();
62 FillMove(em->move, line->mutable_move());
63 setup_states->push(StateInfo());
64 pos.do_move(em->move, setup_states->top(), pos.gives_check(em->move, CheckInfo(pos)));
65 ProbeMove(&pos, setup_states.get(), !invert, line);
66 pos.undo_move(em->move);
72 void FillMove(Move move, HashProbeMove* decoded) {
73 if (!is_ok(move)) return;
75 Square from = from_sq(move);
76 Square to = to_sq(move);
78 if (type_of(move) == CASTLING) {
79 to = make_square(to > from ? FILE_G : FILE_C, rank_of(from));
82 decoded->set_from_sq(UCI::square(from));
83 decoded->set_to_sq(UCI::square(to));
85 if (type_of(move) == PROMOTION) {
86 decoded->set_promotion(std::string() + " PNBRQK"[promotion_type(move)]);
90 void ProbeMove(Position* pos, std::stack<StateInfo>* setup_states, bool invert, HashProbeLine* response) {
92 TTEntry *entry = TT.probe(pos->key(), found);
93 response->set_found(found);
95 Value value = entry->value();
96 Value eval = entry->eval();
97 Bound bound = entry->bound();
102 if (bound == BOUND_UPPER) {
104 } else if (bound == BOUND_LOWER) {
109 response->set_depth(entry->depth());
110 response->set_eval(eval);
111 response->set_value(value);
112 response->set_bound(HashProbeLine::ValueBound(bound));
114 // Follow the PV until we hit an illegal move.
117 while (found && is_ok(entry->move())) {
118 FillMove(entry->move(), response->add_pv());
119 if (seen.count(pos->key())) break;
120 pv.push(entry->move());
121 seen.insert(pos->key());
122 setup_states->push(StateInfo());
123 pos->do_move(entry->move(), setup_states->top(), pos->gives_check(entry->move(), CheckInfo(*pos)));
124 entry = TT.probe(pos->key(), found);
127 // Unroll the PV back again, so the Position object remains unchanged.
128 while (!pv.empty()) {
129 pos->undo_move(pv.top());
138 std::string server_address("0.0.0.0:50051");
139 HashProbeImpl service;
141 ServerBuilder builder;
142 builder.AddListeningPort(server_address, grpc::InsecureServerCredentials());
143 builder.RegisterService(&service);
144 std::unique_ptr<Server> server(builder.BuildAndStart());
145 std::cout << "Server listening on " << server_address << std::endl;
153 int main(int argc, char* argv[]) {
155 std::cout << engine_info() << std::endl;
164 Threads.set(Options["Threads"]);
165 Search::clear(); // After threads are up
167 std::thread(&rpc_thread).detach();
169 UCI::loop(argc, argv);