Subversion Repositories Games.Chess Giants

Rev

Rev 169 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  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-2015 Marco Costalba, Joona Kiiski, Tord Romstad
  5.   Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
  6.  
  7.   Stockfish is free software: you can redistribute it and/or modify
  8.   it under the terms of the GNU General Public License as published by
  9.   the Free Software Foundation, either version 3 of the License, or
  10.   (at your option) any later version.
  11.  
  12.   Stockfish is distributed in the hope that it will be useful,
  13.   but WITHOUT ANY WARRANTY; without even the implied warranty of
  14.   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15.   GNU General Public License for more details.
  16.  
  17.   You should have received a copy of the GNU General Public License
  18.   along with this program.  If not, see <http://www.gnu.org/licenses/>.
  19. */
  20.  
  21. #include <fstream>
  22. #include <iostream>
  23. #include <istream>
  24. #include <vector>
  25.  
  26. #include "misc.h"
  27. #include "position.h"
  28. #include "search.h"
  29. #include "thread.h"
  30. #include "uci.h"
  31.  
  32. using namespace std;
  33.  
  34. namespace {
  35.  
  36. const vector<string> Defaults = {
  37.   "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
  38.   "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 10",
  39.   "8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - - 0 11",
  40.   "4rrk1/pp1n3p/3q2pQ/2p1pb2/2PP4/2P3N1/P2B2PP/4RRK1 b - - 7 19",
  41.   "rq3rk1/ppp2ppp/1bnpb3/3N2B1/3NP3/7P/PPPQ1PP1/2KR3R w - - 7 14",
  42.   "r1bq1r1k/1pp1n1pp/1p1p4/4p2Q/4Pp2/1BNP4/PPP2PPP/3R1RK1 w - - 2 14",
  43.   "r3r1k1/2p2ppp/p1p1bn2/8/1q2P3/2NPQN2/PPP3PP/R4RK1 b - - 2 15",
  44.   "r1bbk1nr/pp3p1p/2n5/1N4p1/2Np1B2/8/PPP2PPP/2KR1B1R w kq - 0 13",
  45.   "r1bq1rk1/ppp1nppp/4n3/3p3Q/3P4/1BP1B3/PP1N2PP/R4RK1 w - - 1 16",
  46.   "4r1k1/r1q2ppp/ppp2n2/4P3/5Rb1/1N1BQ3/PPP3PP/R5K1 w - - 1 17",
  47.   "2rqkb1r/ppp2p2/2npb1p1/1N1Nn2p/2P1PP2/8/PP2B1PP/R1BQK2R b KQ - 0 11",
  48.   "r1bq1r1k/b1p1npp1/p2p3p/1p6/3PP3/1B2NN2/PP3PPP/R2Q1RK1 w - - 1 16",
  49.   "3r1rk1/p5pp/bpp1pp2/8/q1PP1P2/b3P3/P2NQRPP/1R2B1K1 b - - 6 22",
  50.   "r1q2rk1/2p1bppp/2Pp4/p6b/Q1PNp3/4B3/PP1R1PPP/2K4R w - - 2 18",
  51.   "4k2r/1pb2ppp/1p2p3/1R1p4/3P4/2r1PN2/P4PPP/1R4K1 b - - 3 22",
  52.   "3q2k1/pb3p1p/4pbp1/2r5/PpN2N2/1P2P2P/5PP1/Q2R2K1 b - - 4 26",
  53.   "6k1/6p1/6Pp/ppp5/3pn2P/1P3K2/1PP2P2/3N4 b - - 0 1",
  54.   "3b4/5kp1/1p1p1p1p/pP1PpP1P/P1P1P3/3KN3/8/8 w - - 0 1",
  55.   "2K5/p7/7P/5pR1/8/5k2/r7/8 w - - 0 1",
  56.   "8/6pk/1p6/8/PP3p1p/5P2/4KP1q/3Q4 w - - 0 1",
  57.   "7k/3p2pp/4q3/8/4Q3/5Kp1/P6b/8 w - - 0 1",
  58.   "8/2p5/8/2kPKp1p/2p4P/2P5/3P4/8 w - - 0 1",
  59.   "8/1p3pp1/7p/5P1P/2k3P1/8/2K2P2/8 w - - 0 1",
  60.   "8/pp2r1k1/2p1p3/3pP2p/1P1P1P1P/P5KR/8/8 w - - 0 1",
  61.   "8/3p4/p1bk3p/Pp6/1Kp1PpPp/2P2P1P/2P5/5B2 b - - 0 1",
  62.   "5k2/7R/4P2p/5K2/p1r2P1p/8/8/8 b - - 0 1",
  63.   "6k1/6p1/P6p/r1N5/5p2/7P/1b3PP1/4R1K1 w - - 0 1",
  64.   "1r3k2/4q3/2Pp3b/3Bp3/2Q2p2/1p1P2P1/1P2KP2/3N4 w - - 0 1",
  65.   "6k1/4pp1p/3p2p1/P1pPb3/R7/1r2P1PP/3B1P2/6K1 w - - 0 1",
  66.   "8/3p3B/5p2/5P2/p7/PP5b/k7/6K1 w - - 0 1",
  67.  
  68.   // 5-man positions
  69.   "8/8/8/8/5kp1/P7/8/1K1N4 w - - 0 1",     // Kc2 - mate
  70.   "8/8/8/5N2/8/p7/8/2NK3k w - - 0 1",      // Na2 - mate
  71.   "8/3k4/8/8/8/4B3/4KB2/2B5 w - - 0 1",    // draw
  72.  
  73.   // 6-man positions
  74.   "8/8/1P6/5pr1/8/4R3/7k/2K5 w - - 0 1",   // Re5 - mate
  75.   "8/2p4P/8/kr6/6R1/8/8/1K6 w - - 0 1",    // Ka2 - mate
  76.   "8/8/3P3k/8/1p6/8/1P6/1K3n2 b - - 0 1",  // Nd2 - draw
  77.  
  78.   // 7-man positions
  79.   "8/R7/2q5/8/6k1/8/1P5p/K6R w - - 0 124"  // Draw
  80. };
  81.  
  82. } // namespace
  83.  
  84. /// benchmark() runs a simple benchmark by letting Stockfish analyze a set
  85. /// of positions for a given limit each. There are five parameters: the
  86. /// transposition table size, the number of search threads that should
  87. /// be used, the limit value spent for each position (optional, default is
  88. /// depth 13), an optional file name where to look for positions in FEN
  89. /// format (defaults are the positions defined above) and the type of the
  90. /// limit value: depth (default), time in millisecs or number of nodes.
  91.  
  92. void benchmark(const Position& current, istream& is) {
  93.  
  94.   string token;
  95.   vector<string> fens;
  96.   Search::LimitsType limits;
  97.  
  98.   // Assign default values to missing arguments
  99.   string ttSize    = (is >> token) ? token : "16";
  100.   string threads   = (is >> token) ? token : "1";
  101.   string limit     = (is >> token) ? token : "13";
  102.   string fenFile   = (is >> token) ? token : "default";
  103.   string limitType = (is >> token) ? token : "depth";
  104.  
  105.   Options["Hash"]    = ttSize;
  106.   Options["Threads"] = threads;
  107.   Search::clear();
  108.  
  109.   if (limitType == "time")
  110.       limits.movetime = stoi(limit); // movetime is in millisecs
  111.  
  112.   else if (limitType == "nodes")
  113.       limits.nodes = stoi(limit);
  114.  
  115.   else if (limitType == "mate")
  116.       limits.mate = stoi(limit);
  117.  
  118.   else
  119.       limits.depth = stoi(limit);
  120.  
  121.   if (fenFile == "default")
  122.       fens = Defaults;
  123.  
  124.   else if (fenFile == "current")
  125.       fens.push_back(current.fen());
  126.  
  127.   else
  128.   {
  129.       string fen;
  130.       ifstream file(fenFile);
  131.  
  132.       if (!file.is_open())
  133.       {
  134.           cerr << "Unable to open file " << fenFile << endl;
  135.           return;
  136.       }
  137.  
  138.       while (getline(file, fen))
  139.           if (!fen.empty())
  140.               fens.push_back(fen);
  141.  
  142.       file.close();
  143.   }
  144.  
  145.   uint64_t nodes = 0;
  146.   TimePoint elapsed = now();
  147.  
  148.   for (size_t i = 0; i < fens.size(); ++i)
  149.   {
  150.       Position pos(fens[i], Options["UCI_Chess960"], Threads.main());
  151.  
  152.       cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl;
  153.  
  154.       if (limitType == "perft")
  155.           nodes += Search::perft(pos, limits.depth * ONE_PLY);
  156.  
  157.       else
  158.       {
  159.           Search::StateStackPtr st;
  160.           limits.startTime = now();
  161.           Threads.start_thinking(pos, limits, st);
  162.           Threads.main()->wait_for_search_finished();
  163.           nodes += Threads.nodes_searched();
  164.       }
  165.   }
  166.  
  167.   elapsed = now() - elapsed + 1; // Ensure positivity to avoid a 'divide by zero'
  168.  
  169.   dbg_print(); // Just before exiting
  170.  
  171.   cerr << "\n==========================="
  172.        << "\nTotal time (ms) : " << elapsed
  173.        << "\nNodes searched  : " << nodes
  174.        << "\nNodes/second    : " << 1000 * nodes / elapsed << endl;
  175. }
  176.