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-2012 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/>.
29 #include "ucioption.h"
33 static const char* Defaults[] = {
34 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
35 "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 10",
36 "8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - - 0 11",
37 "4rrk1/pp1n3p/3q2pQ/2p1pb2/2PP4/2P3N1/P2B2PP/4RRK1 b - - 7 19",
38 "rq3rk1/ppp2ppp/1bnpb3/3N2B1/3NP3/7P/PPPQ1PP1/2KR3R w - - 7 14",
39 "r1bq1r1k/1pp1n1pp/1p1p4/4p2Q/4Pp2/1BNP4/PPP2PPP/3R1RK1 w - - 2 14",
40 "r3r1k1/2p2ppp/p1p1bn2/8/1q2P3/2NPQN2/PPP3PP/R4RK1 b - - 2 15",
41 "r1bbk1nr/pp3p1p/2n5/1N4p1/2Np1B2/8/PPP2PPP/2KR1B1R w kq - 0 13",
42 "r1bq1rk1/ppp1nppp/4n3/3p3Q/3P4/1BP1B3/PP1N2PP/R4RK1 w - - 1 16",
43 "4r1k1/r1q2ppp/ppp2n2/4P3/5Rb1/1N1BQ3/PPP3PP/R5K1 w - - 1 17",
44 "2rqkb1r/ppp2p2/2npb1p1/1N1Nn2p/2P1PP2/8/PP2B1PP/R1BQK2R b KQ - 0 11",
45 "r1bq1r1k/b1p1npp1/p2p3p/1p6/3PP3/1B2NN2/PP3PPP/R2Q1RK1 w - - 1 16",
46 "3r1rk1/p5pp/bpp1pp2/8/q1PP1P2/b3P3/P2NQRPP/1R2B1K1 b - - 6 22",
47 "r1q2rk1/2p1bppp/2Pp4/p6b/Q1PNp3/4B3/PP1R1PPP/2K4R w - - 2 18",
48 "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - - 3 22",
49 "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26"
53 /// benchmark() runs a simple benchmark by letting Stockfish analyze a set
54 /// of positions for a given limit each. There are five parameters; the
55 /// transposition table size, the number of search threads that should
56 /// be used, the limit value spent for each position (optional, default is
57 /// depth 12), an optional file name where to look for positions in fen
58 /// format (defaults are the positions defined above) and the type of the
59 /// limit value: depth (default), time in secs or number of nodes.
61 void benchmark(const Position& current, istream& is) {
64 Search::LimitsType limits;
67 // Assign default values to missing arguments
68 string ttSize = (is >> token) ? token : "128";
69 string threads = (is >> token) ? token : "1";
70 string limit = (is >> token) ? token : "12";
71 string fenFile = (is >> token) ? token : "default";
72 string limitType = (is >> token) ? token : "depth";
74 Options["Hash"] = ttSize;
75 Options["Threads"] = threads;
77 if (limitType == "time")
78 limits.movetime = 1000 * atoi(limit.c_str()); // movetime is in ms
80 else if (limitType == "nodes")
81 limits.nodes = atoi(limit.c_str());
84 limits.depth = atoi(limit.c_str());
86 if (fenFile == "default")
87 fens.assign(Defaults, Defaults + 16);
89 else if (fenFile == "current")
90 fens.push_back(current.to_fen());
95 ifstream file(fenFile.c_str());
99 cerr << "Unable to open file " << fenFile << endl;
103 while (getline(file, fen))
111 Time time = Time::current_time();
113 for (size_t i = 0; i < fens.size(); i++)
115 Position pos(fens[i], Options["UCI_Chess960"], Threads.main_thread());
117 cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl;
119 if (limitType == "perft")
121 int64_t cnt = Search::perft(pos, limits.depth * ONE_PLY);
122 cerr << "\nPerft " << limits.depth << " leaf nodes: " << cnt << endl;
127 Threads.start_searching(pos, limits, vector<Move>());
128 Threads.wait_for_search_finished();
129 nodes += Search::RootPosition.nodes_searched();
133 int e = time.elapsed();
135 cerr << "\n==========================="
136 << "\nTotal time (ms) : " << e
137 << "\nNodes searched : " << nodes
138 << "\nNodes/second : " << int(nodes / (e / 1000.0)) << endl;