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/>.
29 #include "ucioption.h"
37 static const string BenchmarkPositions[] = {
38 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
39 "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq -",
40 "8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - -",
41 "4rrk1/pp1n3p/3q2pQ/2p1pb2/2PP4/2P3N1/P2B2PP/4RRK1 b - - 7 19",
42 "rq3rk1/ppp2ppp/1bnpb3/3N2B1/3NP3/7P/PPPQ1PP1/2KR3R w - - 7 14",
43 "r1bq1r1k/1pp1n1pp/1p1p4/4p2Q/4Pp2/1BNP4/PPP2PPP/3R1RK1 w - - 2 14",
44 "r3r1k1/2p2ppp/p1p1bn2/8/1q2P3/2NPQN2/PPP3PP/R4RK1 b - - 2 15",
45 "r1bbk1nr/pp3p1p/2n5/1N4p1/2Np1B2/8/PPP2PPP/2KR1B1R w kq - 0 13",
46 "r1bq1rk1/ppp1nppp/4n3/3p3Q/3P4/1BP1B3/PP1N2PP/R4RK1 w - - 1 16",
47 "4r1k1/r1q2ppp/ppp2n2/4P3/5Rb1/1N1BQ3/PPP3PP/R5K1 w - - 1 17",
48 "2rqkb1r/ppp2p2/2npb1p1/1N1Nn2p/2P1PP2/8/PP2B1PP/R1BQK2R b KQ - 0 11",
49 "r1bq1r1k/b1p1npp1/p2p3p/1p6/3PP3/1B2NN2/PP3PPP/R2Q1RK1 w - - 1 16",
50 "3r1rk1/p5pp/bpp1pp2/8/q1PP1P2/b3P3/P2NQRPP/1R2B1K1 b - - 6 22",
51 "r1q2rk1/2p1bppp/2Pp4/p6b/Q1PNp3/4B3/PP1R1PPP/2K4R w - - 2 18",
52 "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - - 3 22",
53 "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26"
61 /// benchmark() runs a simple benchmark by letting Stockfish analyze a set
62 /// of positions for a given limit each. There are five parameters; the
63 /// transposition table size, the number of search threads that should
64 /// be used, the limit value spent for each position (optional, default
65 /// is ply 12), an optional file name where to look for positions in fen
66 /// format (default are the BenchmarkPositions defined above) and the type
67 /// of the limit value: depth (default), time in secs or number of nodes.
68 /// The analysis is written to a file named bench.txt.
70 void benchmark(int argc, char* argv[]) {
72 vector<string> positions;
73 string ttSize, threads, valStr, posFile, valType;
74 int val, secsPerPos, maxDepth, maxNodes;
76 ttSize = argc > 2 ? argv[2] : "128";
77 threads = argc > 3 ? argv[3] : "1";
78 valStr = argc > 4 ? argv[4] : "12";
79 posFile = argc > 5 ? argv[5] : "default";
80 valType = argc > 6 ? argv[6] : "depth";
82 Options["Hash"].set_value(ttSize);
83 Options["Threads"].set_value(threads);
84 Options["OwnBook"].set_value("false");
85 Options["Use Search Log"].set_value("true");
86 Options["Search Log Filename"].set_value("bench.txt");
88 secsPerPos = maxDepth = maxNodes = 0;
89 val = atoi(valStr.c_str());
91 if (valType == "depth" || valType == "perft")
93 else if (valType == "time")
94 secsPerPos = val * 1000;
98 if (posFile != "default")
100 ifstream fenFile(posFile.c_str());
101 if (!fenFile.is_open())
103 cerr << "Unable to open positions file " << posFile << endl;
104 Application::exit_with_failure();
107 while (fenFile.good())
109 getline(fenFile, pos);
111 positions.push_back(pos);
115 for (int i = 0; i < 16; i++)
116 positions.push_back(string(BenchmarkPositions[i]));
118 vector<string>::iterator it;
120 int64_t totalNodes = 0;
121 int startTime = get_system_time();
123 for (it = positions.begin(); it != positions.end(); ++it, ++cnt)
125 Move moves[1] = { MOVE_NONE };
126 int dummy[2] = { 0, 0 };
127 Position pos(*it, 0);
128 cerr << "\nBench position: " << cnt << '/' << positions.size() << endl << endl;
129 if (valType == "perft")
131 int64_t perftCnt = perft(pos, maxDepth * ONE_PLY);
132 cerr << "\nPerft " << maxDepth << " result (nodes searched): " << perftCnt << endl << endl;
133 totalNodes += perftCnt;
135 if (!think(pos, false, false, dummy, dummy, 0, maxDepth, maxNodes, secsPerPos, moves))
137 totalNodes += pos.nodes_searched();
141 cnt = get_system_time() - startTime;
142 cerr << "==============================="
143 << "\nTotal time (ms) : " << cnt
144 << "\nNodes searched : " << totalNodes
145 << "\nNodes/second : " << (int)(totalNodes/(cnt/1000.0)) << endl << endl;
147 // Under MS Visual C++ debug window always unconditionally closes
148 // when program 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;