Deal with Stockfish internal API changes.
[stockfish] / src / main.cpp
1 /*
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
6
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.
11
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.
16
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/>.
19 */
20
21 #include <deque>
22 #include <iostream>
23 #include <stack>
24 #include <thread>
25
26 #include "bitboard.h"
27 #include "position.h"
28 #include "search.h"
29 #include "thread.h"
30 #include "tt.h"
31 #include "uci.h"
32 #include "syzygy/tbprobe.h"
33
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"
39
40 using grpc::Server;
41 using grpc::ServerBuilder;
42 using grpc::ServerContext;
43 using grpc::Status;
44 using grpc::StatusCode;
45 using namespace hashprobe;
46
47 Status HashProbeImpl::Probe(ServerContext* context,
48                             const HashProbeRequest* request,
49                             HashProbeResponse *response) {
50         Position pos;
51         StateInfo st;
52         pos.set(request->fen(), /*isChess960=*/false, &st, Threads.main());
53         if (!pos.pos_is_ok()) {
54                 return Status(StatusCode::INVALID_ARGUMENT, "Invalid FEN");
55         }
56
57         bool invert = (pos.side_to_move() == BLACK);
58         StateListPtr setup_states = StateListPtr(new std::deque<StateInfo>(1));
59
60         ProbeMove(&pos, setup_states.get(), invert, response->mutable_root());
61
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);
70         }
71
72         return Status::OK;
73 }
74
75 void HashProbeImpl::FillMove(Move move, HashProbeMove* decoded) {
76         if (!is_ok(move)) return;
77
78         Square from = from_sq(move);
79         Square to = to_sq(move);
80
81         if (type_of(move) == CASTLING) {
82                 to = make_square(to > from ? FILE_G : FILE_C, rank_of(from));
83         }
84                 
85         decoded->set_from_sq(UCI::square(from));
86         decoded->set_to_sq(UCI::square(to));
87
88         if (type_of(move) == PROMOTION) {
89                 decoded->set_promotion(std::string() + " PNBRQK"[promotion_type(move)]);
90         }
91 }
92
93 void HashProbeImpl::ProbeMove(Position* pos, std::deque<StateInfo>* setup_states, bool invert, HashProbeLine* response) {
94         bool found;
95         TTEntry *entry = TT.probe(pos->key(), found);
96         response->set_found(found);
97         if (found) {
98                 Value value = entry->value();
99                 Value eval = entry->eval();
100                 Bound bound = entry->bound();
101
102                 if (invert) {
103                         value = -value;
104                         eval = -eval;
105                         if (bound == BOUND_UPPER) {
106                                 bound = BOUND_LOWER;
107                         } else if (bound == BOUND_LOWER) {
108                                 bound = BOUND_UPPER;
109                         }
110                 }
111
112                 response->set_depth(entry->depth());
113                 FillValue(eval, response->mutable_eval());
114                 if (entry->depth() > DEPTH_NONE) {
115                         FillValue(value, response->mutable_value());
116                 }
117                 response->set_bound(HashProbeLine::ValueBound(bound));
118
119                 // Follow the PV until we hit an illegal move.
120                 std::stack<Move> pv;
121                 std::set<Key> seen;
122                 while (found && is_ok(entry->move())) {
123                         FillMove(entry->move(), response->add_pv());
124                         if (seen.count(pos->key())) break;
125                         pv.push(entry->move());
126                         seen.insert(pos->key());
127                         setup_states->push_back(StateInfo());
128                         pos->do_move(entry->move(), setup_states->back(), pos->gives_check(entry->move()));
129                         entry = TT.probe(pos->key(), found);
130                 }
131
132                 // Unroll the PV back again, so the Position object remains unchanged.
133                 while (!pv.empty()) {
134                         pos->undo_move(pv.top());
135                         pv.pop();
136                 }
137         }
138 }
139
140 void HashProbeImpl::FillValue(Value value, HashProbeScore* score) {
141         if (abs(value) < VALUE_MATE - MAX_PLY) {
142                 score->set_score_type(HashProbeScore::SCORE_CP);
143                 score->set_score_cp(value * 100 / PawnValueEg);
144         } else {
145                 score->set_score_type(HashProbeScore::SCORE_MATE);
146                 score->set_score_mate((value > 0 ? VALUE_MATE - value + 1 : -VALUE_MATE - value) / 2);
147         }
148 }
149
150 HashProbeThread::HashProbeThread(const std::string &server_address) {
151         builder.AddListeningPort(server_address, grpc::InsecureServerCredentials());
152         builder.RegisterService(&service);
153         server = std::move(builder.BuildAndStart());
154         std::cout << "Server listening on " << server_address << std::endl;
155         std::thread([this]{ server->Wait(); }).detach();
156 }
157
158 void HashProbeThread::Shutdown() {
159         server->Shutdown();
160 }
161
162 namespace PSQT {
163   void init();
164 }
165
166 int main(int argc, char* argv[]) {
167
168   std::cout << engine_info() << std::endl;
169
170   UCI::init(Options);
171   PSQT::init();
172   Bitboards::init();
173   Position::init();
174   Bitbases::init();
175   Search::init();
176   Pawns::init();
177   Threads.set(Options["Threads"]);
178   Search::clear(); // After threads are up
179
180   UCI::loop(argc, argv);
181
182   Threads.set(0);
183   return 0;
184 }