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-2014 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/>.
31 #include "ucioption.h"
35 static const char* Defaults[] = {
36 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
37 "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 10",
38 "8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - - 0 11",
39 "4rrk1/pp1n3p/3q2pQ/2p1pb2/2PP4/2P3N1/P2B2PP/4RRK1 b - - 7 19",
40 "rq3rk1/ppp2ppp/1bnpb3/3N2B1/3NP3/7P/PPPQ1PP1/2KR3R w - - 7 14",
41 "r1bq1r1k/1pp1n1pp/1p1p4/4p2Q/4Pp2/1BNP4/PPP2PPP/3R1RK1 w - - 2 14",
42 "r3r1k1/2p2ppp/p1p1bn2/8/1q2P3/2NPQN2/PPP3PP/R4RK1 b - - 2 15",
43 "r1bbk1nr/pp3p1p/2n5/1N4p1/2Np1B2/8/PPP2PPP/2KR1B1R w kq - 0 13",
44 "r1bq1rk1/ppp1nppp/4n3/3p3Q/3P4/1BP1B3/PP1N2PP/R4RK1 w - - 1 16",
45 "4r1k1/r1q2ppp/ppp2n2/4P3/5Rb1/1N1BQ3/PPP3PP/R5K1 w - - 1 17",
46 "2rqkb1r/ppp2p2/2npb1p1/1N1Nn2p/2P1PP2/8/PP2B1PP/R1BQK2R b KQ - 0 11",
47 "r1bq1r1k/b1p1npp1/p2p3p/1p6/3PP3/1B2NN2/PP3PPP/R2Q1RK1 w - - 1 16",
48 "3r1rk1/p5pp/bpp1pp2/8/q1PP1P2/b3P3/P2NQRPP/1R2B1K1 b - - 6 22",
49 "r1q2rk1/2p1bppp/2Pp4/p6b/Q1PNp3/4B3/PP1R1PPP/2K4R w - - 2 18",
50 "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - - 3 22",
51 "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26",
52 "6k1/6p1/6Pp/ppp5/3pn2P/1P3K2/1PP2P2/3N4 b - - 0 1",
53 "3b4/5kp1/1p1p1p1p/pP1PpP1P/P1P1P3/3KN3/8/8 w - - 0 1",
54 "2K5/p7/7P/5pR1/8/5k2/r7/8 w - - 0 1",
55 "8/6pk/1p6/8/PP3p1p/5P2/4KP1q/3Q4 w - - 0 1",
56 "7k/3p2pp/4q3/8/4Q3/5Kp1/P6b/8 w - - 0 1",
57 "8/2p5/8/2kPKp1p/2p4P/2P5/3P4/8 w - - 0 1",
58 "8/1p3pp1/7p/5P1P/2k3P1/8/2K2P2/8 w - - 0 1",
59 "8/pp2r1k1/2p1p3/3pP2p/1P1P1P1P/P5KR/8/8 w - - 0 1",
60 "8/3p4/p1bk3p/Pp6/1Kp1PpPp/2P2P1P/2P5/5B2 b - - 0 1",
61 "5k2/7R/4P2p/5K2/p1r2P1p/8/8/8 b - - 0 1",
62 "6k1/6p1/P6p/r1N5/5p2/7P/1b3PP1/4R1K1 w - - 0 1",
63 "1r3k2/4q3/2Pp3b/3Bp3/2Q2p2/1p1P2P1/1P2KP2/3N4 w - - 0 1",
64 "6k1/4pp1p/3p2p1/P1pPb3/R7/1r2P1PP/3B1P2/6K1 w - - 0 1",
65 "8/3p3B/5p2/5P2/p7/PP5b/k7/6K1 w - - 0 1"
69 /// benchmark() runs a simple benchmark by letting Stockfish analyze a set
70 /// of positions for a given limit each. There are five parameters: the
71 /// transposition table size, the number of search threads that should
72 /// be used, the limit value spent for each position (optional, default is
73 /// depth 13), an optional file name where to look for positions in FEN
74 /// format (defaults are the positions defined above) and the type of the
75 /// limit value: depth (default), time in secs or number of nodes.
77 void benchmark(const Position& current, istream& is) {
80 Search::LimitsType limits;
83 // Assign default values to missing arguments
84 string ttSize = (is >> token) ? token : "32";
85 string threads = (is >> token) ? token : "1";
86 string limit = (is >> token) ? token : "13";
87 string fenFile = (is >> token) ? token : "default";
88 string limitType = (is >> token) ? token : "depth";
90 Options["Hash"] = ttSize;
91 Options["Threads"] = threads;
94 if (limitType == "time")
95 limits.movetime = 1000 * atoi(limit.c_str()); // movetime is in ms
97 else if (limitType == "nodes")
98 limits.nodes = atoi(limit.c_str());
100 else if (limitType == "mate")
101 limits.mate = atoi(limit.c_str());
104 limits.depth = atoi(limit.c_str());
106 if (fenFile == "default")
107 fens.assign(Defaults, Defaults + 30);
109 else if (fenFile == "current")
110 fens.push_back(current.fen());
115 ifstream file(fenFile.c_str());
119 cerr << "Unable to open file " << fenFile << endl;
123 while (getline(file, fen))
131 Search::StateStackPtr st;
132 Time::point elapsed = Time::now();
134 for (size_t i = 0; i < fens.size(); ++i)
136 Position pos(fens[i], Options["UCI_Chess960"], Threads.main());
138 cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl;
140 if (limitType == "divide")
141 for (MoveList<LEGAL> it(pos); *it; ++it)
144 pos.do_move(*it, si);
145 uint64_t cnt = limits.depth > 1 ? Search::perft(pos, (limits.depth - 1) * ONE_PLY) : 1;
147 cerr << move_to_uci(*it, pos.is_chess960()) << ": " << cnt << endl;
150 else if (limitType == "perft")
152 uint64_t cnt = Search::perft(pos, limits.depth * ONE_PLY);
153 cerr << "\nPerft " << limits.depth << " leaf nodes: " << cnt << endl;
158 Threads.start_thinking(pos, limits, st);
159 Threads.wait_for_think_finished();
160 nodes += Search::RootPos.nodes_searched();
164 elapsed = Time::now() - elapsed + 1; // Ensure positivity to avoid a 'divide by zero'
166 dbg_print(); // Just before to exit
168 cerr << "\n==========================="
169 << "\nTotal time (ms) : " << elapsed
170 << "\nNodes searched : " << nodes
171 << "\nNodes/second : " << 1000 * nodes / elapsed << endl;