X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbenchmark.cpp;h=6d69541fcb574755fd21126880edbebc2bf6a38b;hp=f58d82e2cdf3df840906aee516c2ca72d95b89ce;hb=8de29390f2d2bd31585b93ff46eae3051126f666;hpb=087b638f6c8982927cbff0d44d6fb825a567e182 diff --git a/src/benchmark.cpp b/src/benchmark.cpp index f58d82e2..6d69541f 100644 --- a/src/benchmark.cpp +++ b/src/benchmark.cpp @@ -2,6 +2,7 @@ Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -26,7 +27,6 @@ #include "position.h" #include "search.h" #include "thread.h" -#include "tt.h" #include "uci.h" using namespace std; @@ -76,7 +76,7 @@ const vector Defaults = { "8/8/3P3k/8/1p6/8/1P6/1K3n2 b - - 0 1", // Nd2 - draw // 7-man positions - "8/R7/2q5/8/6k1/8/1P5p/K6R w - - 0 124", // Draw + "8/R7/2q5/8/6k1/8/1P5p/K6R w - - 0 124" // Draw }; } // namespace @@ -92,8 +92,8 @@ const vector Defaults = { void benchmark(const Position& current, istream& is) { string token; - Search::LimitsType limits; vector fens; + Search::LimitsType limits; // Assign default values to missing arguments string ttSize = (is >> token) ? token : "16"; @@ -104,10 +104,10 @@ void benchmark(const Position& current, istream& is) { Options["Hash"] = ttSize; Options["Threads"] = threads; - Search::reset(); + Search::clear(); if (limitType == "time") - limits.movetime = stoi(limit); // movetime is in ms + limits.movetime = stoi(limit); // movetime is in millisecs else if (limitType == "nodes") limits.nodes = stoi(limit); @@ -152,20 +152,21 @@ void benchmark(const Position& current, istream& is) { cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl; if (limitType == "perft") - nodes += Search::perft(pos, limits.depth * ONE_PLY); + nodes += Search::perft(pos, limits.depth * ONE_PLY); else { Search::StateStackPtr st; + limits.startTime = now(); Threads.start_thinking(pos, limits, st); - Threads.main()->join(); - nodes += Search::RootPos.nodes_searched(); + Threads.main()->wait_for_search_finished(); + nodes += Threads.nodes_searched(); } } elapsed = now() - elapsed + 1; // Ensure positivity to avoid a 'divide by zero' - dbg_print(); // Just before to exit + dbg_print(); // Just before exiting cerr << "\n===========================" << "\nTotal time (ms) : " << elapsed