mirror of
https://github.com/opelly27/Stockfish.git
synced 2026-05-20 05:07:46 +00:00
Marco Costalba
c0bb041539
Rewrite the code in SF style, simplify and document it. Code is now much clear and bug free (no mem-leaks and other small issues) and is also smaller (more than 600 lines of code removed). All the code has been rewritten but root_probe() and root_probe_wdl() that are completely misplaced and should be retired altogheter. For now just leave them in the original version. Code is fully and deeply tested for equivalency both in functionality and in speed with hundreds of games and test positions and is guaranteed to be 100% equivalent to the original. Tested with tb_dbg branch for functional equivalency on more than 12M positions. stockfish.exe bench 128 1 16 syzygy.epd Position: 2016/2016 Total 12121156 Hits 0 hit rate (%) 0 Total time (ms) : 4417851 Nodes searched : 1100151204 Nodes/second : 249024 Tested with 5,000 games match against master, 1 Thread, 128 MB Hash each, tc 40+0.4, which is almost equivalent to LTC in Fishtest on this machine. 3-, 4- and 5-men syzygy bases on SSD, 12-moves opening book to emphasize mid- and endgame. Score of SF-SyzygyC++ vs SF-Master: 633 - 617 - 3750 [0.502] 5000 ELO difference: 1 No functional change.
80 lines
2.5 KiB
C++
80 lines
2.5 KiB
C++
/*
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
Copyright (c) 2013 Ronald de Man
|
|
Copyright (C) 2016 Marco Costalba, Lucas Braesch
|
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef TBPROBE_H
|
|
#define TBPROBE_H
|
|
|
|
#include <ostream>
|
|
|
|
#include "../search.h"
|
|
|
|
namespace Tablebases {
|
|
|
|
enum WDLScore {
|
|
WDLLoss = -2, // Loss
|
|
WDLCursedLoss = -1, // Loss, but draw under 50-move rule
|
|
WDLDraw = 0, // Draw
|
|
WDLCursedWin = 1, // Win, but draw under 50-move rule
|
|
WDLWin = 2, // Win
|
|
|
|
WDLScoreNone = -1000
|
|
};
|
|
|
|
// Possible states after a probing operation
|
|
enum ProbeState {
|
|
FAIL = 0, // Probe failed (missing file table)
|
|
OK = 1, // Probe succesful
|
|
CHANGE_STM = -1, // DTZ should check the other side
|
|
ZEROING_BEST_MOVE = 2 // Best move zeroes DTZ (capture or pawn move)
|
|
};
|
|
|
|
extern int MaxCardinality;
|
|
|
|
void init(const std::string& paths);
|
|
WDLScore probe_wdl(Position& pos, ProbeState* result);
|
|
int probe_dtz(Position& pos, ProbeState* result);
|
|
bool root_probe(Position& pos, Search::RootMoves& rootMoves, Value& score);
|
|
bool root_probe_wdl(Position& pos, Search::RootMoves& rootMoves, Value& score);
|
|
void filter_root_moves(Position& pos, Search::RootMoves& rootMoves);
|
|
|
|
inline std::ostream& operator<<(std::ostream& os, const WDLScore v) {
|
|
|
|
os << (v == WDLLoss ? "Loss" :
|
|
v == WDLCursedLoss ? "Cursed loss" :
|
|
v == WDLDraw ? "Draw" :
|
|
v == WDLCursedWin ? "Cursed win" :
|
|
v == WDLWin ? "Win" : "None");
|
|
|
|
return os;
|
|
}
|
|
|
|
inline std::ostream& operator<<(std::ostream& os, const ProbeState v) {
|
|
|
|
os << (v == FAIL ? "Failed" :
|
|
v == OK ? "Success" :
|
|
v == CHANGE_STM ? "Probed opponent side" :
|
|
v == ZEROING_BEST_MOVE ? "Best move zeroes DTZ" : "None");
|
|
|
|
return os;
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|