X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbenchmark.cpp;h=590299d91439b981974fcd8c19647f909ae85072;hp=5102b369d2ea0457f4afe0c02e6de52cf3197d1f;hb=b1e79fed99d52dcb20d2d6a9c62522226e957963;hpb=d3600c39a745179ed6b094b305d0645e83a1ee86 diff --git a/src/benchmark.cpp b/src/benchmark.cpp index 5102b369..590299d9 100644 --- a/src/benchmark.cpp +++ b/src/benchmark.cpp @@ -1,18 +1,18 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008 Marco Costalba + Copyright (C) 2008-2009 Marco Costalba 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 . */ @@ -30,12 +30,13 @@ #include "thread.h" #include "ucioption.h" +using namespace std; //// //// Variables //// -const std::string BenchmarkPositions[] = { +const string BenchmarkPositions[] = { "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1", "r4rk1/1b2qppp/p1n1p3/1p6/1b1PN3/3BRN2/PP3PPP/R2Q2K1 b - - 7 16", "4r1k1/ppq3pp/3b4/2pP4/2Q1p3/4B1P1/PP5P/R5K1 b - - 0 20", @@ -53,7 +54,7 @@ const std::string BenchmarkPositions[] = { "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - 3 22", "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26" }; - + //// //// Functions @@ -67,66 +68,92 @@ const std::string BenchmarkPositions[] = { /// format (default are the BenchmarkPositions defined above). /// The analysis is written to a file named bench.txt. -void benchmark(const std::string& commandLine) { +void benchmark(const string& commandLine) { - std::istringstream csVal(commandLine); - std::istringstream csStr(commandLine); - std::string ttSize, threads, fileName; - int val, secsPerPos; + istringstream csVal(commandLine); + istringstream csStr(commandLine); + string ttSize, threads, fileName, limitType; + int val, secsPerPos, maxDepth, maxNodes; csStr >> ttSize; csVal >> val; if (val < 4 || val > 1024) { - std::cerr << "The hash table size must be between 4 and 1024" << std::endl; - exit(EXIT_FAILURE); + cerr << "The hash table size must be between 4 and 1024" << endl; + Application::exit_with_failure(); } csStr >> threads; csVal >> val; if (val < 1 || val > THREAD_MAX) { - std::cerr << "The number of threads must be between 1 and " << THREAD_MAX - << std::endl; - exit(EXIT_FAILURE); - } + cerr << "The number of threads must be between 1 and " << THREAD_MAX << endl; + Application::exit_with_failure(); + } set_option_value("Hash", ttSize); set_option_value("Threads", threads); set_option_value("OwnBook", "false"); set_option_value("Use Search Log", "true"); set_option_value("Search Log Filename", "bench.txt"); - csVal >> secsPerPos; + csVal >> val; csVal >> fileName; + csVal >> limitType; + + secsPerPos = maxDepth = maxNodes = 0; + + if (limitType == "time") + secsPerPos = val * 1000; + else if (limitType == "depth") + maxDepth = val; + else + maxNodes = val; + + vector positions; - std::vector positions; - if (fileName != "default") { - std::ifstream fenFile(fileName.c_str()); + ifstream fenFile(fileName.c_str()); if (!fenFile.is_open()) { - std::cerr << "Unable to open positions file " << fileName - << std::endl; - exit(EXIT_FAILURE); - } - std::string pos; + cerr << "Unable to open positions file " << fileName << endl; + Application::exit_with_failure(); + } + string pos; while (fenFile.good()) { - std::getline(fenFile, pos); + getline(fenFile, pos); if (!pos.empty()) positions.push_back(pos); } fenFile.close(); } else for (int i = 0; i < 16; i++) - positions.push_back(std::string(BenchmarkPositions[i])); + positions.push_back(string(BenchmarkPositions[i])); - std::vector::iterator it; - for (it = positions.begin(); it != positions.end(); ++it) + int startTime = get_system_time(); + vector::iterator it; + int cnt = 1; + int64_t totalNodes = 0; + for (it = positions.begin(); it != positions.end(); ++it, ++cnt) { - Move moves[1] = {MOVE_NONE}; - int dummy[2] = {0, 0}; + Move moves[1] = {MOVE_NONE}; + int dummy[2] = {0, 0}; Position pos(*it); - think(pos, true, false, 0, dummy, dummy, 0, 0, 0, secsPerPos * 1000, moves); + cout << "\nProcessing position " << cnt << '/' << positions.size() << endl << endl; + if (!think(pos, true, false, 0, dummy, dummy, 0, maxDepth, maxNodes, secsPerPos, moves)) + break; + totalNodes += nodes_searched(); } + cnt = get_system_time() - startTime; + cout << "\nProcessing time (ms) " << cnt + << "\nNodes searched " << totalNodes + << "\nNodes/second " << (int)(totalNodes/(cnt/1000.0)) + << endl; + + // Under MS Visual C++ debug window always unconditionally closes + // when program exits, this is bad because we want to read results before. + #if (defined(WINDOWS) || defined(WIN32) || defined(WIN64)) + cout << "Press any key to exit" << endl; + cin >> fileName; + #endif }