2 Glaurung, a UCI chess playing engine.
3 Copyright (C) 2004-2008 Tord Romstad
5 Glaurung is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 Glaurung is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
27 #include "benchmark.h"
30 #include "ucioption.h"
37 const std::string BenchmarkPositions[] = {
38 "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
39 "r4rk1/1b2qppp/p1n1p3/1p6/1b1PN3/3BRN2/PP3PPP/R2Q2K1 b - - 7 16",
40 "4r1k1/ppq3pp/3b4/2pP4/2Q1p3/4B1P1/PP5P/R5K1 b - - 0 20",
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 Glaurung analyze a set
62 /// of positions for a given time each. There are four parameters; the
63 /// transposition table size, the number of search threads that should
64 /// be used, the time in seconds spent for each position (optional, default
65 /// is 60) and an optional file name where to look for positions in fen
66 /// format (default are the BenchmarkPositions defined above).
67 /// The analysis is written to a file named bench.txt.
69 void benchmark(const std::string& commandLine) {
71 std::istringstream csVal(commandLine);
72 std::istringstream csStr(commandLine);
73 std::string ttSize, threads, fileName;
78 if (val < 4 || val > 1024)
80 std::cerr << "The hash table size must be between 4 and 1024" << std::endl;
85 if (val < 1 || val > THREAD_MAX)
87 std::cerr << "The number of threads must be between 1 and " << THREAD_MAX
91 set_option_value("Hash", ttSize);
92 set_option_value("Threads", threads);
93 set_option_value("OwnBook", "false");
94 set_option_value("Use Search Log", "true");
95 set_option_value("Search Log Filename", "bench.txt");
100 std::vector<std::string> positions;
102 if (fileName != "default")
104 std::ifstream fenFile(fileName.c_str());
105 if (!fenFile.is_open())
107 std::cerr << "Unable to open positions file " << fileName
112 while (fenFile.good())
114 std::getline(fenFile, pos);
116 positions.push_back(pos);
120 for (int i = 0; i < 16; i++)
121 positions.push_back(std::string(BenchmarkPositions[i]));
123 std::vector<std::string>::iterator it;
124 for (it = positions.begin(); it != positions.end(); ++it)
\r
126 Move moves[1] = {MOVE_NONE};
\r
127 int dummy[2] = {0, 0};
\r
129 think(pos, true, false, 0, dummy, dummy, 0, 0, 0, secsPerPos * 1000, moves);
\r