2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
30 #include "ucioption.h"
38 static const string BenchmarkPositions[] = {
39 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
40 "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq -",
41 "8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - -",
42 "4rrk1/pp1n3p/3q2pQ/2p1pb2/2PP4/2P3N1/P2B2PP/4RRK1 b - - 7 19",
43 "rq3rk1/ppp2ppp/1bnpb3/3N2B1/3NP3/7P/PPPQ1PP1/2KR3R w - - 7 14",
44 "r1bq1r1k/1pp1n1pp/1p1p4/4p2Q/4Pp2/1BNP4/PPP2PPP/3R1RK1 w - - 2 14",
45 "r3r1k1/2p2ppp/p1p1bn2/8/1q2P3/2NPQN2/PPP3PP/R4RK1 b - - 2 15",
46 "r1bbk1nr/pp3p1p/2n5/1N4p1/2Np1B2/8/PPP2PPP/2KR1B1R w kq - 0 13",
47 "r1bq1rk1/ppp1nppp/4n3/3p3Q/3P4/1BP1B3/PP1N2PP/R4RK1 w - - 1 16",
48 "4r1k1/r1q2ppp/ppp2n2/4P3/5Rb1/1N1BQ3/PPP3PP/R5K1 w - - 1 17",
49 "2rqkb1r/ppp2p2/2npb1p1/1N1Nn2p/2P1PP2/8/PP2B1PP/R1BQK2R b KQ - 0 11",
50 "r1bq1r1k/b1p1npp1/p2p3p/1p6/3PP3/1B2NN2/PP3PPP/R2Q1RK1 w - - 1 16",
51 "3r1rk1/p5pp/bpp1pp2/8/q1PP1P2/b3P3/P2NQRPP/1R2B1K1 b - - 6 22",
52 "r1q2rk1/2p1bppp/2Pp4/p6b/Q1PNp3/4B3/PP1R1PPP/2K4R w - - 2 18",
53 "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - - 3 22",
54 "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26"
62 /// benchmark() runs a simple benchmark by letting Stockfish analyze a set
63 /// of positions for a given time each. There are four parameters; the
64 /// transposition table size, the number of search threads that should
65 /// be used, the time in seconds spent for each position (optional, default
66 /// is 60) and an optional file name where to look for positions in fen
67 /// format (default are the BenchmarkPositions defined above).
68 /// The analysis is written to a file named bench.txt.
70 void benchmark(const string& commandLine) {
72 istringstream csStr(commandLine);
73 vector<string> positions;
74 string ttSize, threads, limit, posFile, limitType;
75 int val, secsPerPos, maxDepth, maxNodes;
77 csStr >> ttSize >> threads >> limit >> posFile >> limitType;
79 Options["Hash"].set_value(ttSize);
80 Options["Threads"].set_value(threads);
81 Options["OwnBook"].set_value("false");
82 Options["Use Search Log"].set_value("true");
83 Options["Search Log Filename"].set_value("bench.txt");
85 secsPerPos = maxDepth = maxNodes = 0;
86 val = atoi(limit.c_str());
88 if (limitType == "depth" || limitType == "perft")
90 else if (limitType == "time")
91 secsPerPos = val * 1000;
95 if (posFile != "default")
97 ifstream fenFile(posFile.c_str());
98 if (!fenFile.is_open())
100 cerr << "Unable to open positions file " << posFile << endl;
101 Application::exit_with_failure();
104 while (fenFile.good())
106 getline(fenFile, pos);
108 positions.push_back(pos);
112 for (int i = 0; i < 16; i++)
113 positions.push_back(string(BenchmarkPositions[i]));
115 vector<string>::iterator it;
117 int64_t totalNodes = 0;
118 int startTime = get_system_time();
120 for (it = positions.begin(); it != positions.end(); ++it, ++cnt)
122 Move moves[1] = { MOVE_NONE };
123 int dummy[2] = { 0, 0 };
124 Position pos(*it, 0);
125 cerr << "\nBench position: " << cnt << '/' << positions.size() << endl << endl;
126 if (limitType == "perft")
128 int64_t perftCnt = perft(pos, maxDepth * ONE_PLY);
129 cerr << "\nPerft " << maxDepth << " result (nodes searched): " << perftCnt << endl << endl;
130 totalNodes += perftCnt;
132 if (!think(pos, false, false, dummy, dummy, 0, maxDepth, maxNodes, secsPerPos, moves))
134 totalNodes += pos.nodes_searched();
138 cnt = get_system_time() - startTime;
139 cerr << "==============================="
140 << "\nTotal time (ms) : " << cnt
141 << "\nNodes searched : " << totalNodes
142 << "\nNodes/second : " << (int)(totalNodes/(cnt/1000.0)) << endl << endl;
144 // Under MS Visual C++ debug window always unconditionally closes
145 // when program exits, this is bad because we want to read results before.
146 #if (defined(WINDOWS) || defined(WIN32) || defined(WIN64))
147 cerr << "Press any key to exit" << endl;