-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathevaluation.cpp
100 lines (94 loc) · 3.12 KB
/
evaluation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/*
* This file is part of uci-analyser: a UCI-based Chess Game Analyser
* Copyright (C) 2013-2017 David J. Barnes
*
* uci-analyser is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* uci-analyser is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with uci-analyser. If not, see <http://www.gnu.org/licenses/>.
*
* David J. Barnes may be contacted as d.j.barnes@kent.ac.uk
* https://www.cs.kent.ac.uk/people/staff/djb/
*/
#include <iostream>
#include <sstream>
#include "evaluation.h"
#include "utils.h"
using namespace std;
/*
* Extract the evaluation details from an "info"
* output from the engine.
*/
void Evaluation::extractInfo(const vector<string> &tokens, const string& info) {
int numTokens = tokens.size();
this->cpValue = 0;
this->lowerBound = false;
this->upperBound = false;
this->variation = 0;
this->forcedMate = false;
this->mateInMoves = 0;
for (int t = 1; t < numTokens;) {
string token = tokens[t];
t++;
if (token == "depth") {
string value = tokens[t];
t++;
this->depth = strToInt(value);
} else if (token == "seldepth") {
string depth = tokens[t];
t++;
} else if (token == "score") {
string scoreType = tokens[t];
t++;
if (scoreType == "cp") {
string value = tokens[t];
t++;
cpValue = strToInt(value);
} else if (scoreType == "mate") {
string moves = tokens[t];
t++;
forcedMate = true;
mateInMoves = strToInt(moves);
}
string nextToken = tokens[t];
if (nextToken == "lowerbound") {
lowerBound = true;
t++;
} else if (nextToken == "upperbound") {
upperBound = true;
t++;
}
} else if (token == "multipv") {
string multipv = tokens[t];
t++;
this->variation = strToInt(multipv);
} else if (token == "nodes") {
this->nodes = strToInt(tokens[t]);
t++;
} else if (token == "nps") {
string nps = tokens[t];
t++;
} else if (token == "pv") {
// Remaining tokens are the moves of the line.
for (; t < numTokens; t++) {
this->moves.push_back(tokens[t]);
}
} else if (token == "time") {
this->time = tokens[t];
t++;
} else {
#ifdef DEBUG
cout << "# Unrecognised token " << token << " in: " << endl;
cout << "# " << info << endl;
#endif
}
}
}