HCha/Stockfish
1
0
Fork 0
mirror of https://github.com/HChaZZY/Stockfish.git synced 2025-12-21 17:46:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

Sync Root new depth to what we do in search()

Browse Source 
This allow us to restore the old depth 12 benchmark
and fixes one and for all the depth mess.

Test confirms no regression:
After 5658 games 892 - 924 - 3842  ELO -1 (+- 5.2)

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2011-02-17 08:55:56 +01:00
parent 29fa6f3c5f
commit 932ae761c6
3 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/benchmark.cpp
View File

@@ -77,7 +77,7 @@ void benchmark(int argc, char* argv[]) {
ttSize = argc > 2 ? argv[2] : "128"; ttSize = argc > 2 ? argv[2] : "128";
threads = argc > 3 ? argv[3] : "1"; threads = argc > 3 ? argv[3] : "1";
valStr = argc > 4 ? argv[4] : "11"; valStr = argc > 4 ? argv[4] : "12";
posFile = argc > 5 ? argv[5] : "default"; posFile = argc > 5 ? argv[5] : "default";
valType = argc > 6 ? argv[6] : "depth"; valType = argc > 6 ? argv[6] : "depth";

2
src/main.cpp
View File

@@ -100,7 +100,7 @@ int main(int argc, char* argv[]) {
{ {
if (string(argv[1]) != "bench" || argc > 7) if (string(argv[1]) != "bench" || argc > 7)
cout << "Usage: stockfish bench [hash size = 128] [threads = 1] " cout << "Usage: stockfish bench [hash size = 128] [threads = 1] "
<< "[limit = 11] [fen positions file = default] " << "[limit = 12] [fen positions file = default] "
<< "[depth, time, perft or node limited = depth]" << endl; << "[depth, time, perft or node limited = depth]" << endl;
else else
benchmark(argc, argv); benchmark(argc, argv);

2
src/search.cpp
View File

@@ -1070,7 +1070,7 @@ split_point_start: // At split points actual search starts from here
// Update current move (this must be done after singular extension search) // Update current move (this must be done after singular extension search)
ss->currentMove = move; ss->currentMove = move;
newDepth = depth - (!Root ? ONE_PLY : DEPTH_ZERO) + ext; newDepth = depth - ONE_PLY + ext;
// Step 12. Futility pruning (is omitted in PV nodes) // Step 12. Futility pruning (is omitted in PV nodes)
if ( !PvNode if ( !PvNode