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/>.
26 #include "ucioption.h"
30 static const string Defaults[] = {
31 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
32 "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq -",
33 "8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - -",
34 "4rrk1/pp1n3p/3q2pQ/2p1pb2/2PP4/2P3N1/P2B2PP/4RRK1 b - - 7 19",
35 "rq3rk1/ppp2ppp/1bnpb3/3N2B1/3NP3/7P/PPPQ1PP1/2KR3R w - - 7 14",
36 "r1bq1r1k/1pp1n1pp/1p1p4/4p2Q/4Pp2/1BNP4/PPP2PPP/3R1RK1 w - - 2 14",
37 "r3r1k1/2p2ppp/p1p1bn2/8/1q2P3/2NPQN2/PPP3PP/R4RK1 b - - 2 15",
38 "r1bbk1nr/pp3p1p/2n5/1N4p1/2Np1B2/8/PPP2PPP/2KR1B1R w kq - 0 13",
39 "r1bq1rk1/ppp1nppp/4n3/3p3Q/3P4/1BP1B3/PP1N2PP/R4RK1 w - - 1 16",
40 "4r1k1/r1q2ppp/ppp2n2/4P3/5Rb1/1N1BQ3/PPP3PP/R5K1 w - - 1 17",
41 "2rqkb1r/ppp2p2/2npb1p1/1N1Nn2p/2P1PP2/8/PP2B1PP/R1BQK2R b KQ - 0 11",
42 "r1bq1r1k/b1p1npp1/p2p3p/1p6/3PP3/1B2NN2/PP3PPP/R2Q1RK1 w - - 1 16",
43 "3r1rk1/p5pp/bpp1pp2/8/q1PP1P2/b3P3/P2NQRPP/1R2B1K1 b - - 6 22",
44 "r1q2rk1/2p1bppp/2Pp4/p6b/Q1PNp3/4B3/PP1R1PPP/2K4R w - - 2 18",
45 "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - - 3 22",
46 "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26",
51 /// benchmark() runs a simple benchmark by letting Stockfish analyze a set
52 /// of positions for a given limit each. There are five parameters; the
53 /// transposition table size, the number of search threads that should
54 /// be used, the limit value spent for each position (optional, default
55 /// is ply 12), an optional file name where to look for positions in fen
56 /// format (default are the BenchmarkPositions defined above) and the type
57 /// of the limit value: depth (default), time in secs or number of nodes.
58 /// The analysis is written to a file named bench.txt.
60 void benchmark(int argc, char* argv[]) {
62 vector<string> fenList;
67 // Load default positions
68 for (int i = 0; !Defaults[i].empty(); i++)
69 fenList.push_back(Defaults[i]);
71 // Assign default values to missing arguments
72 string ttSize = argc > 2 ? argv[2] : "128";
73 string threads = argc > 3 ? argv[3] : "1";
74 string valStr = argc > 4 ? argv[4] : "12";
75 string fenFile = argc > 5 ? argv[5] : "default";
76 string valType = argc > 6 ? argv[6] : "depth";
78 Options["Hash"].set_value(ttSize);
79 Options["Threads"].set_value(threads);
80 Options["OwnBook"].set_value("false");
82 // Search should be limited by nodes, time or depth ?
83 if (valType == "nodes")
84 limits.maxNodes = atoi(valStr.c_str());
85 else if (valType == "time")
86 limits.maxTime = 1000 * atoi(valStr.c_str()); // maxTime is in ms
88 limits.maxDepth = atoi(valStr.c_str());
90 // Do we need to load positions from a given FEN file ?
91 if (fenFile != "default")
94 ifstream f(fenFile.c_str());
100 while (getline(f, fen))
102 fenList.push_back(fen);
108 cerr << "Unable to open FEN file " << fenFile << endl;
113 // Ok, let's start the benchmark !
115 time = get_system_time();
117 for (size_t i = 0; i < fenList.size(); i++)
119 Move moves[] = { MOVE_NONE };
120 Position pos(fenList[i], false, 0);
122 cerr << "\nBench position: " << i + 1 << '/' << fenList.size() << endl;
124 if (valType == "perft")
126 int64_t cnt = perft(pos, limits.maxDepth * ONE_PLY);
129 cerr << "\nPerft " << limits.maxDepth << " nodes counted: " << cnt << endl;
133 if (!think(pos, limits, moves))
136 totalNodes += pos.nodes_searched();
140 time = get_system_time() - time;
142 cerr << "\n==============================="
143 << "\nTotal time (ms) : " << time
144 << "\nNodes searched : " << totalNodes
145 << "\nNodes/second : " << (int)(totalNodes / (time / 1000.0)) << endl << endl;
147 // MS Visual C++ debug window always unconditionally closes when program
148 // exits, this is bad because we want to read results before.
149 #if (defined(WINDOWS) || defined(WIN32) || defined(WIN64))
150 cerr << "Press any key to exit" << endl;