/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#include <fstream>
#include <iostream>
+#include <istream>
#include <vector>
#include "misc.h"
#include "position.h"
#include "search.h"
#include "thread.h"
+#include "tt.h"
#include "ucioption.h"
using namespace std;
-using namespace Search;
static const char* Defaults[] = {
"rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
/// format (defaults are the positions defined above) and the type of the
/// limit value: depth (default), time in secs or number of nodes.
-void benchmark(int argc, char* argv[]) {
+void benchmark(const Position& current, istream& is) {
+ string token;
+ Search::LimitsType limits;
vector<string> fens;
- LimitsType limits;
- int time;
- int64_t nodes = 0;
// Assign default values to missing arguments
- string ttSize = argc > 2 ? argv[2] : "128";
- string threads = argc > 3 ? argv[3] : "1";
- string valStr = argc > 4 ? argv[4] : "12";
- string fenFile = argc > 5 ? argv[5] : "default";
- string valType = argc > 6 ? argv[6] : "depth";
+ string ttSize = (is >> token) ? token : "32";
+ string threads = (is >> token) ? token : "1";
+ string limit = (is >> token) ? token : "12";
+ string fenFile = (is >> token) ? token : "default";
+ string limitType = (is >> token) ? token : "depth";
Options["Hash"] = ttSize;
Options["Threads"] = threads;
- Options["OwnBook"] = false;
+ TT.clear();
+
+ if (limitType == "time")
+ limits.movetime = 1000 * atoi(limit.c_str()); // movetime is in ms
- if (valType == "time")
- limits.maxTime = 1000 * atoi(valStr.c_str()); // maxTime is in ms
+ else if (limitType == "nodes")
+ limits.nodes = atoi(limit.c_str());
- else if (valType == "nodes")
- limits.maxNodes = atoi(valStr.c_str());
+ else if (limitType == "mate")
+ limits.mate = atoi(limit.c_str());
else
- limits.maxDepth = atoi(valStr.c_str());
+ limits.depth = atoi(limit.c_str());
+
+ if (fenFile == "default")
+ fens.assign(Defaults, Defaults + 16);
+
+ else if (fenFile == "current")
+ fens.push_back(current.fen());
- if (fenFile != "default")
+ else
{
string fen;
ifstream file(fenFile.c_str());
if (!file.is_open())
{
cerr << "Unable to open file " << fenFile << endl;
- exit(EXIT_FAILURE);
+ return;
}
while (getline(file, fen))
file.close();
}
- else
- fens.assign(Defaults, Defaults + 16);
- time = system_time();
+ int64_t nodes = 0;
+ Search::StateStackPtr st;
+ Search::MovesVectPtr mv;
+ Time::point elapsed = Time::now();
for (size_t i = 0; i < fens.size(); i++)
{
- Position pos(fens[i], false, 0);
+ Position pos(fens[i], Options["UCI_Chess960"], Threads.main_thread());
cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl;
- if (valType == "perft")
+ if (limitType == "perft")
{
- int64_t cnt = perft(pos, limits.maxDepth * ONE_PLY);
- cerr << "\nPerft " << limits.maxDepth << " leaf nodes: " << cnt << endl;
+ size_t cnt = Search::perft(pos, limits.depth * ONE_PLY);
+ cerr << "\nPerft " << limits.depth << " leaf nodes: " << cnt << endl;
nodes += cnt;
}
else
{
- Threads.start_thinking(pos, limits, vector<Move>(), false);
- nodes += RootPosition.nodes_searched();
+ Threads.start_thinking(pos, limits, vector<Move>(), st, mv);
+ Threads.wait_for_think_finished();
+ nodes += Search::RootPos.nodes_searched();
}
}
- time = system_time() - time;
+ elapsed = Time::now() - elapsed + 1; // Assure positive to avoid a 'divide by zero'
cerr << "\n==========================="
- << "\nTotal time (ms) : " << time
+ << "\nTotal time (ms) : " << elapsed
<< "\nNodes searched : " << nodes
- << "\nNodes/second : " << int(nodes / (time / 1000.0)) << endl;
+ << "\nNodes/second : " << 1000 * nodes / elapsed << endl;
}