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/>.
32 #include "syzygy/tbprobe.h"
34 #include <grpc/grpc.h>
35 #include <grpc++/server.h>
36 #include <grpc++/server_builder.h>
37 #include "hashprobe.h"
38 #include "hashprobe.grpc.pb.h"
41 using grpc::ServerBuilder;
42 using grpc::ServerContext;
44 using grpc::StatusCode;
45 using namespace hashprobe;
47 Status HashProbeImpl::Probe(ServerContext* context,
48 const HashProbeRequest* request,
49 HashProbeResponse *response) {
52 pos.set(request->fen(), /*isChess960=*/false, &st, Threads.main());
53 if (!pos.pos_is_ok()) {
54 return Status(StatusCode::INVALID_ARGUMENT, "Invalid FEN");
57 bool invert = (pos.side_to_move() == BLACK);
58 StateListPtr setup_states = StateListPtr(new std::deque<StateInfo>(1));
60 ProbeMove(&pos, setup_states.get(), invert, response->mutable_root());
62 MoveList<LEGAL> moves(pos);
63 for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) {
64 HashProbeLine *line = response->add_line();
65 FillMove(em->move, line->mutable_move());
66 setup_states->push_back(StateInfo());
67 pos.do_move(em->move, setup_states->back(), pos.gives_check(em->move));
68 ProbeMove(&pos, setup_states.get(), !invert, line);
69 pos.undo_move(em->move);
75 void HashProbeImpl::FillMove(Move move, HashProbeMove* decoded) {
76 if (!is_ok(move)) return;
78 Square from = from_sq(move);
79 Square to = to_sq(move);
81 if (type_of(move) == CASTLING) {
82 to = make_square(to > from ? FILE_G : FILE_C, rank_of(from));
85 decoded->set_from_sq(UCI::square(from));
86 decoded->set_to_sq(UCI::square(to));
88 if (type_of(move) == PROMOTION) {
89 decoded->set_promotion(std::string() + " PNBRQK"[promotion_type(move)]);
93 void HashProbeImpl::ProbeMove(Position* pos, std::deque<StateInfo>* setup_states, bool invert, HashProbeLine* response) {
95 TTEntry *entry = TT.probe(pos->key(), found);
96 response->set_found(found);
98 Value value = entry->value();
99 Value eval = entry->eval();
100 Bound bound = entry->bound();
105 if (bound == BOUND_UPPER) {
107 } else if (bound == BOUND_LOWER) {
112 response->set_depth(entry->depth());
113 FillValue(eval, response->mutable_eval());
114 if (entry->depth() > DEPTH_NONE) {
115 FillValue(value, response->mutable_value());
117 response->set_bound(HashProbeLine::ValueBound(bound));
119 // Follow the PV until we hit an illegal move.
122 while (found && is_ok(entry->move()) &&
123 pos->pseudo_legal(entry->move()) &&
124 pos->legal(entry->move())) {
125 FillMove(entry->move(), response->add_pv());
126 if (seen.count(pos->key())) break;
127 pv.push(entry->move());
128 seen.insert(pos->key());
129 setup_states->push_back(StateInfo());
130 pos->do_move(entry->move(), setup_states->back(), pos->gives_check(entry->move()));
131 entry = TT.probe(pos->key(), found);
134 // Unroll the PV back again, so the Position object remains unchanged.
135 while (!pv.empty()) {
136 pos->undo_move(pv.top());
142 void HashProbeImpl::FillValue(Value value, HashProbeScore* score) {
143 if (abs(value) < VALUE_MATE - MAX_PLY) {
144 score->set_score_type(HashProbeScore::SCORE_CP);
145 score->set_score_cp(value * 100 / PawnValueEg);
147 score->set_score_type(HashProbeScore::SCORE_MATE);
148 score->set_score_mate((value > 0 ? VALUE_MATE - value + 1 : -VALUE_MATE - value) / 2);
152 HashProbeThread::HashProbeThread(const std::string &server_address) {
153 builder.AddListeningPort(server_address, grpc::InsecureServerCredentials());
154 builder.RegisterService(&service);
155 server = std::move(builder.BuildAndStart());
156 std::cout << "Server listening on " << server_address << std::endl;
157 std::thread([this]{ server->Wait(); }).detach();
160 void HashProbeThread::Shutdown() {
168 int main(int argc, char* argv[]) {
170 std::cout << engine_info() << std::endl;
179 Threads.set(Options["Threads"]);
180 Search::clear(); // After threads are up
182 UCI::loop(argc, argv);