src/benchmark.cpp

   1 /*
   2   Glaurung, a UCI chess playing engine.
   3   Copyright (C) 2004-2008 Tord Romstad
   4
   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.
   9
  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.
  14
  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/>.
  17 */
  18
  19
  20 ////
  21 //// Includes
  22 ////
  23
  24 #include "benchmark.h"
  25 #include "search.h"
  26 #include "thread.h"
  27 #include "ucioption.h"
  28
  29
  30 ////
  31 //// Variables
  32 ////
  33
  34 const std::string BenchmarkPositions[15] = {
  35   "r4rk1/1b2qppp/p1n1p3/1p6/1b1PN3/3BRN2/PP3PPP/R2Q2K1 b - - 7 16",
  36   "4r1k1/ppq3pp/3b4/2pP4/2Q1p3/4B1P1/PP5P/R5K1 b - - 0 20",
  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"
  50 };
  51
  52
  53 ////
  54 //// Functions
  55 ////
  56
  57 /// benchmark() runs a simple benchmark by letting Glaurung analyze 15
  58 /// positions for 60 seconds each.  There are two parameters; the
  59 /// transposition table size and the number of search threads that should
  60 /// be used.  The analysis is written to a file named bench.txt.
  61
  62 void benchmark(const std::string &ttSize, const std::string &threads) {
  63   Position pos;
  64   Move moves[1] = {MOVE_NONE};
  65   int i;
  66
  67   i = atoi(ttSize.c_str());
  68   if(i < 4 || i > 1024) {
  69     std::cerr << "The hash table size must be between 4 and 1024" << std::endl;
  70     exit(EXIT_FAILURE);
  71   }
  72
  73   i = atoi(threads.c_str());
  74   if(i < 1 || i > THREAD_MAX) {
  75     std::cerr << "The number of threads must be between 1 and " << THREAD_MAX
  76               << std::endl;
  77     exit(EXIT_FAILURE);
  78   }
  79
  80   set_option_value("Hash", ttSize);
  81   set_option_value("Threads", threads);
  82   set_option_value("OwnBook", "false");
  83   set_option_value("Use Search Log", "true");
  84   set_option_value("Search Log Filename", "bench.txt");
  85
  86   for(i = 0; i < 15; i++) {
  87     pos.from_fen(BenchmarkPositions[i]);
  88     think(pos, true, false, 0, 0, 0, 0, 0, 60000, moves);
  89   }
  90
  91 }