/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2020 The Stockfish developers (see AUTHORS file)
+ Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#include "bitboard.h"
#include "endgame.h"
#include "position.h"
+#include "psqt.h"
#include "search.h"
+#include "syzygy/tbprobe.h"
#include "thread.h"
#include "tt.h"
#include "uci.h"
-#include "syzygy/tbprobe.h"
#include <grpc/grpc.h>
#include <grpc++/server.h>
using grpc::Status;
using grpc::StatusCode;
using namespace hashprobe;
+using namespace Stockfish;
Status HashProbeImpl::Probe(ServerContext* context,
const HashProbeRequest* request,
pretty = "O-O-O";
}
} else if (type_of(moved_piece) == PAWN) {
- if (type_of(move) == ENPASSANT || pos->piece_on(to) != NO_PIECE) {
+ if (type_of(move) == EN_PASSANT || pos->piece_on(to) != NO_PIECE) {
// Capture.
pretty = char('a' + file_of(from));
pretty += "x";
// Remove all illegal moves to disambiguate.
Bitboard att_copy = attackers;
while (att_copy) {
- Square s = pop_lsb(&att_copy);
+ Square s = pop_lsb(att_copy);
Move m = make_move(s, to);
if (!pos->pseudo_legal(m) || !pos->legal(m)) {
attackers &= ~SquareBB[s];
}
}
- if (type_of(move) == ENPASSANT || pos->piece_on(to) != NO_PIECE) {
+ if (type_of(move) == EN_PASSANT || pos->piece_on(to) != NO_PIECE) {
pretty += "x";
}
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();
+ TTEntry entry_copy = *entry;
+ Value value = entry_copy.value();
+ Value eval = entry_copy.eval();
+ Bound bound = entry_copy.bound();
if (invert) {
value = -value;
}
}
- response->set_depth(entry->depth());
+ response->set_depth(entry_copy.depth());
FillValue(eval, response->mutable_eval());
- if (entry->depth() > DEPTH_NONE) {
+ if (entry_copy.depth() > DEPTH_NONE) {
FillValue(value, response->mutable_value());
}
response->set_bound(HashProbeLine::ValueBound(bound));
// Follow the PV until we hit an illegal move.
std::stack<Move> pv;
std::set<Key> seen;
- while (found && is_ok(entry->move()) &&
- pos->pseudo_legal(entry->move()) &&
- pos->legal(entry->move())) {
- FillMove(pos, entry->move(), response->add_pv());
+ while (is_ok(entry_copy.move()) &&
+ pos->pseudo_legal(entry_copy.move()) &&
+ pos->legal(entry_copy.move())) {
+ FillMove(pos, entry_copy.move(), response->add_pv());
if (seen.count(pos->key())) break;
- pv.push(entry->move());
+ pv.push(entry_copy.move());
seen.insert(pos->key());
setup_states->push_back(StateInfo());
- pos->do_move(entry->move(), setup_states->back());
+ pos->do_move(entry_copy.move(), setup_states->back());
entry = TT.probe(pos->key(), found);
+ if (!found) {
+ break;
+ }
+ entry_copy = *entry;
}
// Unroll the PV back again, so the Position object remains unchanged.
server->Shutdown();
}
-namespace PSQT {
- void init();
-}
-
int main(int argc, char* argv[]) {
std::cout << engine_info() << std::endl;
+ CommandLine::init(argc, argv);
UCI::init(Options);
Tune::init();
PSQT::init();
Endgames::init();
Threads.set(size_t(Options["Threads"]));
Search::clear(); // After threads are up
- Eval::init_NNUE();
+ Eval::NNUE::init();
UCI::loop(argc, argv);