2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2023 The Stockfish developers (see AUTHORS file)
5 Stockfish is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Stockfish is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
28 #include "syzygy/tbprobe.h"
33 #include <grpc/grpc.h>
34 #include <grpc++/server.h>
35 #include <grpc++/server_builder.h>
36 #include "hashprobe.h"
37 #include "hashprobe.grpc.pb.h"
41 using grpc::ServerBuilder;
42 using grpc::ServerContext;
44 using grpc::StatusCode;
45 using namespace hashprobe;
46 using namespace Stockfish;
48 Status HashProbeImpl::Probe(ServerContext* context,
49 const HashProbeRequest* request,
50 HashProbeResponse *response) {
53 pos.set(request->fen(), /*isChess960=*/false, &st, Threads.main());
54 if (!pos.pos_is_ok()) {
55 return Status(StatusCode::INVALID_ARGUMENT, "Invalid FEN");
58 bool invert = (pos.side_to_move() == BLACK);
59 StateListPtr setup_states = StateListPtr(new std::deque<StateInfo>(1));
61 ProbeMove(&pos, setup_states.get(), invert, response->mutable_root());
63 MoveList<LEGAL> moves(pos);
64 for (const ExtMove* em = moves.begin(); em != moves.end(); ++em) {
65 HashProbeLine *line = response->add_line();
66 FillMove(&pos, em->move, line->mutable_move());
67 setup_states->push_back(StateInfo());
68 pos.do_move(em->move, setup_states->back());
69 ProbeMove(&pos, setup_states.get(), !invert, line);
70 pos.undo_move(em->move);
76 void HashProbeImpl::FillMove(Position *pos, Move move, HashProbeMove* decoded) {
77 if (!is_ok(move)) return;
79 Square from = from_sq(move);
80 Square to = to_sq(move);
82 if (type_of(move) == CASTLING) {
83 to = make_square(to > from ? FILE_G : FILE_C, rank_of(from));
86 Piece moved_piece = pos->moved_piece(move);
88 if (type_of(move) == CASTLING) {
94 } else if (type_of(moved_piece) == PAWN) {
95 if (type_of(move) == EN_PASSANT || pos->piece_on(to) != NO_PIECE) {
97 pretty = char('a' + file_of(from));
100 pretty += UCI::square(to);
101 if (type_of(move) == PROMOTION) {
103 pretty += " PNBRQK"[promotion_type(move)];
106 pretty = " PNBRQK"[type_of(moved_piece)];
107 Bitboard attackers = pos->attackers_to(to) & pos->pieces(color_of(moved_piece), type_of(moved_piece));
108 if (more_than_one(attackers)) {
109 // Remove all illegal moves to disambiguate.
110 Bitboard att_copy = attackers;
112 Square s = pop_lsb(att_copy);
113 Move m = make_move(s, to);
114 if (!pos->pseudo_legal(m) || !pos->legal(m)) {
115 attackers &= ~square_bb(s);
119 if (more_than_one(attackers)) {
120 // Disambiguate by file if possible.
121 Bitboard attackers_this_file = attackers & file_bb(file_of(from));
122 if (attackers != attackers_this_file) {
123 pretty += char('a' + file_of(from));
124 attackers = attackers_this_file;
126 if (more_than_one(attackers)) {
127 // Still ambiguous, so need to disambiguate by rank.
128 pretty += char('1' + rank_of(from));
132 if (type_of(move) == EN_PASSANT || pos->piece_on(to) != NO_PIECE) {
136 pretty += UCI::square(to);
139 if (pos->gives_check(move)) {
142 pos->do_move(move, si, true);
143 if (MoveList<LEGAL>(*pos).size() > 0) {
148 pos->undo_move(move);
151 decoded->set_pretty(pretty);
154 void HashProbeImpl::ProbeMove(Position* pos, std::deque<StateInfo>* setup_states, bool invert, HashProbeLine* response) {
156 TTEntry *entry = TT.probe(pos->key(), found);
157 response->set_found(found);
159 TTEntry entry_copy = *entry;
160 Value value = entry_copy.value();
161 Value eval = entry_copy.eval();
162 Bound bound = entry_copy.bound();
167 if (bound == BOUND_UPPER) {
169 } else if (bound == BOUND_LOWER) {
174 response->set_depth(entry_copy.depth());
175 FillValue(eval, response->mutable_eval());
176 if (entry_copy.depth() > DEPTH_NONE) {
177 FillValue(value, response->mutable_value());
179 response->set_bound(HashProbeLine::ValueBound(bound));
181 // Follow the PV until we hit an illegal move.
184 while (is_ok(entry_copy.move()) &&
185 pos->pseudo_legal(entry_copy.move()) &&
186 pos->legal(entry_copy.move())) {
187 FillMove(pos, entry_copy.move(), response->add_pv());
188 if (seen.count(pos->key())) break;
189 pv.push(entry_copy.move());
190 seen.insert(pos->key());
191 setup_states->push_back(StateInfo());
192 pos->do_move(entry_copy.move(), setup_states->back());
193 entry = TT.probe(pos->key(), found);
200 // Unroll the PV back again, so the Position object remains unchanged.
201 while (!pv.empty()) {
202 pos->undo_move(pv.top());
208 void HashProbeImpl::FillValue(Value value, HashProbeScore* score) {
209 if (abs(value) < VALUE_MATE - MAX_PLY) {
210 score->set_score_type(HashProbeScore::SCORE_CP);
211 score->set_score_cp(value * 100 / PawnValueEg);
213 score->set_score_type(HashProbeScore::SCORE_MATE);
214 score->set_score_mate((value > 0 ? VALUE_MATE - value + 1 : -VALUE_MATE - value) / 2);
218 HashProbeThread::HashProbeThread(const std::string &server_address) {
219 builder.AddListeningPort(server_address, grpc::InsecureServerCredentials());
220 builder.RegisterService(&service);
221 server = std::move(builder.BuildAndStart());
222 std::cout << "Server listening on " << server_address << std::endl;
223 std::thread([this]{ server->Wait(); }).detach();
226 void HashProbeThread::Shutdown() {
230 int main(int argc, char* argv[]) {
232 std::cout << engine_info() << std::endl;
234 CommandLine::init(argc, argv);
240 Threads.set(size_t(Options["Threads"]));
241 Search::clear(); // After threads are up
244 UCI::loop(argc, argv);