/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2012 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 <iostream>
#include <sstream>
#include <string>
-#include <vector>
#include "evaluate.h"
#include "misc.h"
<< "\npawn key: " << pos.pawn_key() << endl;
else if (token == "uci")
- cout << "id name " << engine_name()
- << "\nid author " << engine_authors()
+ cout << "id name " << engine_info(true)
<< "\n" << Options
<< "\nuciok" << endl;
else
string token;
Search::LimitsType limits;
- std::vector<Move> searchMoves;
+ std::set<Move> searchMoves;
int time[] = { 0, 0 }, inc[] = { 0, 0 };
while (is >> token)
is >> limits.maxTime;
else if (token == "searchmoves")
while (is >> token)
- searchMoves.push_back(move_from_uci(pos, token));
+ searchMoves.insert(move_from_uci(pos, token));
}
limits.time = time[pos.side_to_move()];
void perft(Position& pos, istringstream& is) {
- int depth, time;
+ int depth;
if (!(is >> depth))
return;
- time = system_time();
+ Time time = Time::current_time();
int64_t n = Search::perft(pos, depth * ONE_PLY);
- time = system_time() - time;
+ int e = time.elapsed();
std::cout << "\nNodes " << n
- << "\nTime (ms) " << time
- << "\nNodes/second " << int(n / (time / 1000.0)) << std::endl;
+ << "\nTime (ms) " << e
+ << "\nNodes/second " << int(n / (e / 1000.0)) << std::endl;
}
}