mirror of
https://github.com/sockspls/badfish
synced 2025-05-01 09:13:08 +00:00
7eaea3848c
And passed in do_move(), this ensures maximum efficiency and speed and at the same time unlimited move numbers. The draw back is that to handle Position init we need to reserve a StateInfo inside Position itself and use at init time and when copying from another Position. After lazy SMP we don't need anymore this gimmick and we can get rid of this special case and always pass an external StateInfo to Position object. Also rewritten and simplified Position constructors. Verified it does not regress with a 3 threads SMP test: ELO: -0.00 +-12.7 (95%) LOS: 50.0% Total: 1000 W: 173 L: 173 D: 654 No functional change.
18 lines
404 B
C++
18 lines
404 B
C++
#ifndef TBPROBE_H
|
|
#define TBPROBE_H
|
|
|
|
#include "../search.h"
|
|
|
|
namespace Tablebases {
|
|
|
|
extern int MaxCardinality;
|
|
|
|
void init(const std::string& path);
|
|
int probe_wdl(Position& pos, int *success);
|
|
int probe_dtz(Position& pos, int *success);
|
|
bool root_probe(Position& pos, Search::RootMoves& rootMoves, Value& score);
|
|
bool root_probe_wdl(Position& pos, Search::RootMoves& rootMoves, Value& score);
|
|
|
|
}
|
|
|
|
#endif
|