Repository navigation
Expand file tree
/
Copy patheval.cc
More file actions
319 lines (276 loc) · 10.8 KB
/
Copy patheval.cc
File metadata and controls
319 lines (276 loc) · 10.8 KB
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
// Copyright 2018 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include <stdio.h>
#include <atomic>
#include <cmath>
#include <functional>
#include <iostream>
#include <memory>
#include <string>
#include <thread>
#include <utility>
#include <vector>
#include "absl/memory/memory.h"
#include "absl/strings/str_cat.h"
#include "absl/strings/str_format.h"
#include "absl/strings/str_split.h"
#include "absl/time/clock.h"
#include "absl/time/time.h"
#include "cc/constants.h"
#include "cc/file/path.h"
#include "cc/file/utils.h"
#include "cc/game.h"
#include "cc/game_utils.h"
#include "cc/init.h"
#include "cc/logging.h"
#include "cc/mcts_player.h"
#include "cc/model/batching_model.h"
#include "cc/model/loader.h"
#include "cc/model/model.h"
#include "cc/random.h"
#include "cc/tf_utils.h"
#include "cc/zobrist.h"
#include "gflags/gflags.h"
// Game options flags.
DEFINE_bool(resign_enabled, true, "Whether resign is enabled.");
DEFINE_double(resign_threshold, -0.999, "Resign threshold.");
DEFINE_uint64(seed, 0,
"Random seed. Use default value of 0 to use a time-based seed.");
// Tree search flags.
DEFINE_int32(virtual_losses, 8,
"Number of virtual losses when running tree search.");
DEFINE_double(value_init_penalty, 2.0,
"New children value initialization penalty.\n"
"Child value = parent's value - penalty * color, clamped to"
" [-1, 1]. Penalty should be in [0.0, 2.0].\n"
"0 is init-to-parent, 2.0 is init-to-loss [default].\n"
"This behaves similiarly to Leela's FPU \"First Play Urgency\".");
// Inference flags.
DEFINE_string(eval_model, "",
"Path to a minigo model to evaluate against a target.");
DEFINE_string(eval_device, "",
"Optional ID of the device to the run inference on for the eval "
"model. For TPUs, pass the gRPC address.");
DEFINE_int32(num_eval_readouts, 100,
"Number of readouts to make during tree search for the eval "
"model.)");
DEFINE_string(target_model, "",
"Path to a target minigo model that eval_model is evaluated "
"against.");
DEFINE_string(target_device, "",
"Optional ID of the device to the run inference on for the "
"target model. For TPUs, pass the gRPC address.");
DEFINE_int32(num_target_readouts, 100,
"Number of readouts to make during tree search for the eval "
"model.)");
DEFINE_int32(parallel_games, 32, "Number of games to play in parallel.");
// Output flags.
DEFINE_string(output_bigtable, "",
"Output Bigtable specification, of the form: "
"project,instance,table. "
"If empty, no examples are written to Bigtable.");
DEFINE_string(sgf_dir, "",
"SGF directory for selfplay and puzzles. If empty in selfplay "
"mode, no SGF is written.");
DEFINE_string(bigtable_tag, "", "Used in Bigtable metadata.");
DEFINE_bool(verbose, true, "Enable verbose logging.");
namespace minigo {
namespace {
class Evaluator {
class EvaluatedModel {
public:
EvaluatedModel(BatchingModelFactory* batcher, const std::string& path,
const MctsPlayer::Options& player_options)
: batcher_(batcher), path_(path), player_options_(player_options) {}
std::string name() {
absl::MutexLock lock(&mutex_);
if (name_.empty()) {
// The model's name is lazily initialized the first time we create an
// instance. Make sure it's valid.
NewModelImpl();
}
return name_;
}
WinStats GetWinStats() const {
absl::MutexLock lock(&mutex_);
return win_stats_;
}
void UpdateWinStats(const Game& game) {
absl::MutexLock lock(&mutex_);
win_stats_.Update(game);
}
std::unique_ptr<Model> NewModel() {
absl::MutexLock lock(&mutex_);
return NewModelImpl();
}
const MctsPlayer::Options& player_options() const {
return player_options_;
}
private:
std::unique_ptr<Model> NewModelImpl() EXCLUSIVE_LOCKS_REQUIRED(&mutex_) {
auto model = batcher_->NewModel(path_);
if (name_.empty()) {
name_ = model->name();
}
return model;
}
mutable absl::Mutex mutex_;
BatchingModelFactory* batcher_ GUARDED_BY(&mutex_);
const std::string path_;
std::string name_ GUARDED_BY(&mutex_);
WinStats win_stats_ GUARDED_BY(&mutex_);
MctsPlayer::Options player_options_;
};
public:
Evaluator() {
// Create a batcher for the eval model.
batchers_.push_back(
absl::make_unique<BatchingModelFactory>(FLAGS_eval_device, 2));
// If the target model requires a different device, create one & a second
// batcher too.
if (FLAGS_target_device != FLAGS_eval_device) {
batchers_.push_back(
absl::make_unique<BatchingModelFactory>(FLAGS_target_device, 2));
}
}
void Run() {
auto start_time = absl::Now();
game_options_.resign_enabled = FLAGS_resign_enabled;
game_options_.resign_threshold = -std::abs(FLAGS_resign_threshold);
MctsPlayer::Options player_options;
player_options.virtual_losses = FLAGS_virtual_losses;
player_options.inject_noise = false;
player_options.random_seed = FLAGS_seed;
player_options.tree.value_init_penalty = FLAGS_value_init_penalty;
player_options.tree.soft_pick_enabled = false;
player_options.num_readouts = FLAGS_num_eval_readouts;
EvaluatedModel eval_model(batchers_.front().get(), FLAGS_eval_model,
player_options);
player_options.num_readouts = FLAGS_num_target_readouts;
EvaluatedModel target_model(batchers_.back().get(), FLAGS_target_model,
player_options);
int num_games = FLAGS_parallel_games;
for (int thread_id = 0; thread_id < num_games; ++thread_id) {
bool swap_models = (thread_id & 1) != 0;
threads_.emplace_back(
std::bind(&Evaluator::ThreadRun, this, thread_id,
swap_models ? &target_model : &eval_model,
swap_models ? &eval_model : &target_model));
}
for (auto& t : threads_) {
t.join();
}
MG_LOG(INFO) << "Evaluated " << num_games << " games, total ti
8000
me "
<< (absl::Now() - start_time);
MG_LOG(INFO) << FormatWinStatsTable(
{{eval_model.name(), eval_model.GetWinStats()},
{target_model.name(), target_model.GetWinStats()}});
}
private:
void ThreadRun(int thread_id, EvaluatedModel* black_model,
EvaluatedModel* white_model) {
// Only print the board using ANSI colors if stderr is sent to the
// terminal.
const bool use_ansi_colors = FdSupportsAnsiColors(fileno(stderr));
// The player and other_player reference this pointer.
std::unique_ptr<Model> model;
std::vector<std::string> bigtable_spec =
absl::StrSplit(FLAGS_output_bigtable, ',');
bool use_bigtable = bigtable_spec.size() == 3;
if (!FLAGS_output_bigtable.empty() && !use_bigtable) {
MG_LOG(FATAL)
<< "Bigtable output must be of the form: project,instance,table";
return;
}
Game game(black_model->name(), white_model->name(), game_options_);
const bool verbose = FLAGS_verbose && (thread_id == 0);
auto black = absl::make_unique<MctsPlayer>(
black_model->NewModel(), nullptr, &game, black_model->player_options());
auto white = absl::make_unique<MctsPlayer>(
white_model->NewModel(), nullptr, &game, white_model->player_options());
BatchingModelFactory::StartGame(black->model(), white->model());
auto* curr_player = black.get();
auto* next_player = white.get();
while (!game.game_over()) {
if (curr_player->root()->position.n() >= kMinPassAliveMoves &&
curr_player->root()->position.CalculateWholeBoardPassAlive()) {
// Play pass moves to end the game.
while (!game.game_over()) {
MG_CHECK(curr_player->PlayMove(Coord::kPass));
next_player->PlayOpponentsMove(Coord::kPass);
std::swap(curr_player, next_player);
}
break;
}
auto move = curr_player->SuggestMove(curr_player->options().num_readouts);
if (verbose) {
std::cerr << curr_player->tree().Describe() << "\n";
}
MG_CHECK(curr_player->PlayMove(move));
if (move != Coord::kResign) {
next_player->PlayOpponentsMove(move);
}
if (verbose) {
MG_LOG(INFO) << absl::StreamFormat(
"%d: %s by %s\nQ: %0.4f", curr_player->root()->position.n(),
move.ToGtp(), curr_player->name(), curr_player->root()->Q());
MG_LOG(INFO) << curr_player->root()->position.ToPrettyString(
use_ansi_colors);
}
std::swap(curr_player, next_player);
}
BatchingModelFactory::EndGame(black->model(), white->model());
if (game.result() > 0) {
black_model->UpdateWinStats(game);
} else {
white_model->UpdateWinStats(game);
}
if (verbose) {
MG_LOG(INFO) << game.result_string();
MG_LOG(INFO) << "Black was: " << game.black_name();
}
// Write SGF.
std::string output_name = "NO_SGF_SAVED";
if (!FLAGS_sgf_dir.empty()) {
output_name = absl::StrCat(GetOutputName(game_id_++), "-", black->name(),
"-", white->name());
game.AddComment(
absl::StrCat("B inferences: ", black->GetModelsUsedForInference()));
game.AddComment(
absl::StrCat("W inferences: ", white->GetModelsUsedForInference()));
WriteSgf(FLAGS_sgf_dir, output_name, game, true);
}
if (use_bigtable) {
const auto& gcp_project_name = bigtable_spec[0];
const auto& instance_name = bigtable_spec[1];
const auto& table_name = bigtable_spec[2];
tf_utils::WriteEvalRecord(gcp_project_name, instance_name, table_name,
game, output_name, FLAGS_bigtable_tag);
}
MG_LOG(INFO) << "Thread " << thread_id << " stopping";
}
Game::Options game_options_;
std::vector<std::thread> threads_;
std::atomic<size_t> game_id_{0};
std::vector<std::unique_ptr<BatchingModelFactory>> batchers_;
};
} // namespace
} // namespace minigo
int main(int argc, char* argv[]) {
minigo::Init(&argc, &argv);
minigo::zobrist::Init(FLAGS_seed);
minigo::Evaluator evaluator;
evaluator.Run();
return 0;
}