Repository navigation
Expand file tree
/
Copy pathminigui_gtp_client.cc
More file actions
629 lines (546 loc) · 19.3 KB
/
Copy pathminigui_gtp_client.cc
File metadata and controls
629 lines (546 loc) · 19.3 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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
// Copyright 2019 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 "cc/minigui_gtp_client.h"
#include <algorithm>
#include <cctype>
#include <cmath>
#include <sstream>
#include <utility>
#include "absl/strings/str_cat.h"
#include "absl/strings/str_format.h"
#include "absl/strings/str_join.h"
#include "absl/strings/str_replace.h"
#include "absl/time/clock.h"
#include "cc/constants.h"
#include "cc/file/utils.h"
#include "cc/json.h"
#include "cc/logging.h"
#include "cc/sgf.h"
namespace minigo {
namespace {
// Returns the Q of the best legal child move for the node.
// Returns the node's Q if there are no legal moves.
float GetBestMoveQ(const MctsNode* node) {
float scale = node->position.to_play() == Color::kBlack ? 1 : -1;
float bestChildQ = node->Q();
for (int i = 0; i < kNumMoves; ++i) {
if (!node->position.legal_move(i)) {
continue;
}
if (node->child_Q(i) * scale > bestChildQ * scale) {
bestChildQ = node->child_Q(i);
}
}
return bestChildQ;
}
} // namespace
MiniguiGtpClient::MiniguiGtpClient(
std::string device,
std::shared_ptr<ThreadSafeInferenceCache> inference_cache,
const std::string& model_path, const Game::Options& game_options,
const MctsPlayer::Options& player_options,
const GtpClient::Options& client_options)
: GtpClient(std::move(device), inference_cache, model_path, game_options,
player_options, client_options) {
RegisterCmd("echo", &MiniguiGtpClient::HandleEcho);
RegisterCmd("genmove", &MiniguiGtpClient::HandleGenmove);
RegisterCmd("play", &MiniguiGtpClient::HandlePlay);
RegisterCmd("report_search_interval",
&MiniguiGtpClient::HandleReportSearchInterval);
RegisterCmd("select_position", &MiniguiGtpClient::HandleSelectPosition);
RegisterCmd("winrate_evals", &MiniguiGtpClient::HandleWinrateEvals);
player_->SetTreeSearchCallback(
std::bind(&MiniguiGtpClient::TreeSearchCb, this, std::placeholders::_1));
variation_tree_ = absl::make_unique<VariationTree>();
int num_workers = 16;
int num_win_rate_evals = 8;
auto worker_options = player_options;
worker_options.virtual_losses = 1;
win_rate_evaluator_ = absl::make_unique<WinRateEvaluator>(
num_workers, num_win_rate_evals, device_, inference_cache, model_path,
game_options, worker_options);
}
MiniguiGtpClient::~MiniguiGtpClient() = default;
void MiniguiGtpClient::NewGame() {
GtpClient::NewGame();
variation_tree_ = absl::make_unique<VariationTree>();
ReportRootPosition();
RefreshPendingWinRateEvals();
}
void MiniguiGtpClient::Ponder() {
if (win_rate_evaluator_->all_nodes_have_at_least_one_read()) {
GtpClient::Ponder();
}
win_rate_evaluator_->EvalNodes();
}
GtpClient::Response MiniguiGtpClient::HandleCmd(const std::string& line) {
auto response = GtpClient::HandleCmd(line);
// Write __GTP_CMD_DONE__ to stderr to signify that handling a GTP command is
// done. The Minigui Python server waits for this magic string before it
// consumes the output of each GTP command. This keeps the outputs written to
// stderr and stdout synchronized so that all data written to stderr while
// processing a GTP command is consumed before the GTP result written to
// stdout.
MG_LOG(INFO) << "__GTP_CMD_DONE__";
return response;
}
GtpClient::Response MiniguiGtpClient::HandleEcho(CmdArgs args) {
return Response::Ok(absl::StrJoin(args, " "));
}
GtpClient::Response MiniguiGtpClient::HandleGenmove(CmdArgs args) {
ReportSearchStatus(nullptr, true);
auto response = GtpClient::HandleGenmove(args);
if (response.ok) {
variation_tree_->PlayMove(player_->root()->move);
ReportRootPosition();
}
RefreshPendingWinRateEvals();
return response;
}
GtpClient::Response MiniguiGtpClient::HandlePlay(CmdArgs args) {
auto response = GtpClient::HandlePlay(args);
if (response.ok) {
variation_tree_->PlayMove(player_->root()->move);
ReportRootPosition();
}
RefreshPendingWinRateEvals();
return response;
}
GtpClient::Response MiniguiGtpClient::HandleReportSearchInterval(CmdArgs args) {
auto response = CheckArgsExact(1, args);
if (!response.ok) {
return response;
}
int x;
if (!absl::SimpleAtoi(args[0], &x) || x < 0) {
return Response::Error("couldn't parse ", args[0], " as an integer >= 0");
}
report_search_interval_ = absl::Milliseconds(x);
return Response::Ok();
}
GtpClient::Response MiniguiGtpClient::HandleSelectPosition(CmdArgs args) {
auto response = CheckArgsExact(1, args);
if (!response.ok) {
return response;
}
if (!variation_tree_->SelectNode(std::string(args[0]))) {
return Response::Error("unknown position id");
}
player_->NewGame();
for (auto c : variation_tree_->current_node()->GetVariation()) {
MG_CHECK(player_->PlayMove(c));
}
RefreshPendingWinRateEvals();
return Response::Ok();
}
GtpClient::Response MiniguiGtpClient::HandleWinrateEvals(CmdArgs args) {
int num_reads;
if (!absl::SimpleAtoi(args[1], &num_reads) || num_reads < 0) {
return Response::Error("invalid num_reads");
}
win_rate_evaluator_->SetNumEvalReads(num_reads);
RefreshPendingWinRateEvals();
return Response::Ok();
}
GtpClient::Response MiniguiGtpClient::ReplaySgf(
const sgf::Collection& collection) {
// Traverse the SGF's game trees, loading them into the backend & running
// inference on the positions in batches.
std::function<Response(const sgf::Tree&)> traverse =
[&](const sgf::Tree& tree) {
const auto* original_root = player_->root();
// Play moves for all nodes in this tree.
for (const auto& node : tree.nodes) {
if (node->move.c == Coord::kInvalid) {
// Skip nodes that don't contain a move, appending any comments to
// the current position.
absl::StrAppend(&variation_tree_->current_node()->comment,
node->GetCommentAndProperties());
continue;
}
if (node->move.color != player_->root()->position.to_play()) {
// The move color is different than expected. Play a pass move to
// flip the colors.
if (player_->root()->move == Coord::kPass) {
auto expected = ColorToCode(player_->root()->position.to_play());
auto actual = node->move.ToSgf();
MG_LOG(ERROR)
<< "expected move by " << expected << ", got " << actual
<< " but can't play an intermediate pass because the"
<< " previous move was also a pass";
return Response::Error("cannot load file");
}
MG_LOG(WARNING) << "Inserting pass move";
MG_CHECK(player_->PlayMove(Coord::kPass));
variation_tree_->PlayMove(Coord::kPass);
ReportRootPosition();
}
if (!player_->PlayMove(node->move.c)) {
MG_LOG(ERROR) << "error playing " << node->move.ToSgf();
return Response::Error("cannot load file");
}
variation_tree_->PlayMove(node->move.c);
variation_tree_->current_node()->comment =
node->GetCommentAndProperties();
ReportRootPosition();
}
// Traverse all sub-trees.
for (const auto& sub_tree : tree.sub_trees) {
auto response = traverse(*sub_tree);
if (!response.ok) {
return response;
}
}
// Undo the moves in this tree before returning.
while (player_->root() != original_root) {
player_->UndoMove();
variation_tree_->GoToParent();
}
return Response::Ok();
};
for (const auto& tree : collection.trees) {
auto response = traverse(*tree);
if (!response.ok) {
return response;
}
}
// Play the main line.
player_->NewGame();
variation_tree_->GoToStart();
// The root node of the SGF is created by NewGame, before the SGF is loaded:
// explicitly update the root node comment.
if (!variation_tree_->current_node()->comment.empty()) {
nlohmann::json j = {
{"id", variation_tree_->current_node()->id},
{"comment", variation_tree_->current_node()->comment},
};
MG_LOG(INFO) << "mg-update: " << j.dump();
}
if (!collection.trees.empty()) {
for (const auto& move : collection.trees[0]->ExtractMainLine()) {
// We already validated that all the moves could be played in traverse(),
// so if PlayMove fails here, something has gone seriously awry.
MG_CHECK(player_->PlayMove(move.c));
variation_tree_->PlayMove(move.c);
}
RefreshPendingWinRateEvals();
ReportRootPosition();
}
return Response::Ok();
}
void MiniguiGtpClient::ReportSearchStatus(const MctsNode* leaf,
8000
bool include_tree_stats) {
auto sorted_child_info = player_->tree().CalculateRankedMoveInfo();
auto* root = player_->root();
nlohmann::json j = {
{"id", variation_tree_->current_node()->id},
{"n", root->N()},
{"q", GetBestMoveQ(root)},
};
// TODO(tommadams): Make the number of child variations sent back
// configurable.
nlohmann::json variations;
for (int i = 0; i < 10; ++i) {
Coord c = sorted_child_info[i].c;
const auto child_it = root->children.find(c);
if (child_it == root->children.end() || root->child_N(c) == 0) {
break;
}
nlohmann::json moves = {c.ToGtp()};
const auto* node = child_it->second.get();
for (const auto c : node->GetMostVisitedPath()) {
moves.push_back(c.ToGtp());
}
variations[c.ToGtp()] = {
{"n", root->child_N(c)},
{"q", root->child_Q(c)},
{"moves", std::move(moves)},
};
}
if (!variations.empty()) {
j["variations"] = std::move(variations);
}
// Current live search variation.
if (leaf != nullptr) {
std::vector<const MctsNode*> live;
for (const auto* node = leaf; node != root; node = node->parent) {
live.push_back(node);
}
if (!live.empty()) {
std::reverse(live.begin(), live.end());
nlohmann::json moves;
for (const auto* node : live) {
moves.push_back(node->move.ToGtp());
}
j["variations"]["live"] = {
{"n", live.front()->N()},
{"q", GetBestMoveQ(live.front())},
{"moves", std::move(moves)},
};
}
}
// Child N.
auto& child_N = j["childN"];
for (auto N : root->edges.N) {
child_N.push_back(static_cast<int>(N));
}
// Child Q.
auto& child_Q = j["childQ"];
for (int i = 0; i < kNumMoves; ++i) {
child_Q.push_back(static_cast<int>(std::round(root->child_Q(i) * 1000)));
}
if (include_tree_stats) {
auto tree_stats = player_->tree().CalculateStats();
j["treeStats"] = {
{"numNodes", tree_stats.num_nodes},
{"numLeafNodes", tree_stats.num_leaf_nodes},
{"maxDepth", tree_stats.max_depth},
};
}
MG_LOG(INFO) << "mg-update:" << j.dump();
}
void MiniguiGtpClient::ReportRootPosition() {
const auto* root = player_->root();
const auto& position = root->position;
std::ostringstream oss;
for (const auto& stone : position.stones()) {
char ch;
if (stone.color() == Color::kBlack) {
ch = 'X';
} else if (stone.color() == Color::kWhite) {
ch = 'O';
} else {
ch = '.';
}
oss << ch;
}
nlohmann::json j = {
{"id", variation_tree_->current_node()->id},
{"toPlay", position.to_play() == Color::kBlack ? "B" : "W"},
{"moveNum", position.n()},
{"stones", oss.str()},
{"gameOver", root->game_over()},
};
const auto& captures = position.num_captures();
if (captures[0] != 0 || captures[1] != 0) {
j["caps"].push_back(captures[0]);
j["caps"].push_back(captures[1]);
}
if (root->parent != nullptr) {
j["parentId"] = variation_tree_->current_node()->parent->id;
if (root->N() > 0) {
// Only send Q if the node has been read at least once.
j["q"] = GetBestMoveQ(root);
}
}
if (root->move != Coord::kInvalid) {
j["move"] = root->move.ToGtp();
}
const auto& comment = variation_tree_->current_node()->comment;
if (!comment.empty()) {
j["comment"] = comment;
}
MG_LOG(INFO) << "mg-position: " << j.dump();
}
void MiniguiGtpClient::RefreshPendingWinRateEvals() {
// Build a new list of nodes that require win rate evaluation.
// First, traverse to the leaf node of the current position's main line.
auto* node = variation_tree_->current_node();
while (!node->children.empty()) {
node = node->children[0];
}
std::vector<VariationTree::Node*> variation;
while (node != nullptr) {
variation.push_back(node);
node = node->parent;
}
std::reverse(variation.begin(), variation.end());
win_rate_evaluator_->SetCurrentVariation(std::move(variation));
}
void MiniguiGtpClient::TreeSearchCb(
const std::vector<const MctsNode*>& leaves) {
if (!leaves.empty() && report_search_interval_ != absl::ZeroDuration()) {
auto now = absl::Now();
if (now - last_report_time_ > report_search_interval_) {
last_report_time_ = now;
ReportSearchStatus(leaves.back(), false);
}
}
}
MiniguiGtpClient::VariationTree::Node::Node(Node* parent, Coord move)
: parent(parent),
move(move),
id(parent == nullptr ? "root" : absl::StrFormat("%p", this)),
n(parent != nullptr ? parent->n + 1 : 0) {}
std::vector<Coord> MiniguiGtpClient::VariationTree::Node::GetVariation() const {
std::vector<Coord> variation;
for (auto* node = this; node->parent != nullptr; node = node->parent) {
variation.push_back(node->move);
}
std::reverse(variation.begin(), variation.end());
return variation;
}
MiniguiGtpClient::VariationTree::VariationTree() {
auto root = absl::make_unique<Node>(nullptr, Coord::kInvalid);
current_node_ = root.get();
id_map_.emplace(root->id, std::move(root));
}
void MiniguiGtpClient::VariationTree::PlayMove(Coord c) {
// Check if the current node already has a child with the given move.
for (auto* child : current_node_->children) {
if (child->move == c) {
current_node_ = child;
return;
}
}
// Create a new child.
auto child = absl::make_unique<Node>(current_node_, c);
current_node_->children.push_back(child.get());
current_node_ = current_node_->children.back();
id_map_.emplace(current_node_->id, std::move(child));
}
void MiniguiGtpClient::VariationTree::GoToParent() {
MG_CHECK(current_node_->parent != nullptr);
current_node_ = current_node_->parent;
}
void MiniguiGtpClient::VariationTree::GoToStart() {
while (current_node_->parent != nullptr) {
current_node_ = current_node_->parent;
}
}
bool MiniguiGtpClient::VariationTree::SelectNode(const std::string& id) {
auto it = id_map_.find(id);
if (it == id_map_.end()) {
return false;
}
current_node_ = it->second.get();
return true;
}
MiniguiGtpClient::WinRateEvaluator::WinRateEvaluator(
int num_workers, int num_eval_reads, const std::string& device,
std::shared_ptr<ThreadSafeInferenceCache> inference_cache,
const std::string& model_path, const Game::Options& game_options,
const MctsPlayer::Options& player_options)
: num_eval_reads_(num_eval_reads) {
MG_CHECK(inference_cache != nullptr);
batcher_ = absl::make_unique<BatchingModelFactory>(device, 2);
for (int i = 0; i < num_workers; ++i) {
auto game = absl::make_unique<Game>("b", "w", game_options);
auto player = absl::make_unique<MctsPlayer>(batcher_->NewModel(model_path),
inference_cache, game.get(),
player_options);
workers_.push_back(absl::make_unique<Worker>(
std::move(game), std::move(player), &eval_queue_));
workers_.back()->Start();
}
}
MiniguiGtpClient::WinRateEvaluator::~WinRateEvaluator() = default;
void MiniguiGtpClient::WinRateEvaluator::SetNumEvalReads(int num_eval_reads) {
num_eval_reads_ = num_eval_reads;
UpdateNodesToEval();
}
void MiniguiGtpClient::WinRateEvaluator::SetCurrentVariation(
std::vector<VariationTree::Node*> nodes) {
variation_ = std::move(nodes);
UpdateNodesToEval();
}
void MiniguiGtpClient::WinRateEvaluator::EvalNodes() {
auto num_inferences = std::min(workers_.size(), to_eval_.size());
if (num_inferences == 0) {
return;
}
// Inform each worker how many inferences we want to run in parallel.
// This allows the batcher to know how many inferences to expect.
for (size_t i = 0; i < num_inferences; ++i) {
workers_[i]->Prepare();
}
<
884A
div id="LC538" class="react-file-line html-div" data-testid="code-cell" data-line-number="538" style="position:relative">
// Run win rate evaluation in parallel.
for (size_t i = 0; i < num_inferences; ++i) {
workers_[i]->EvalAsync(to_eval_.front());
to_eval_.pop_front();
}
// Wait for the workers to finish.
for (size_t i = 0; i < num_inferences; ++i) {
auto* node = eval_queue_.Pop();
// auto* node = workers_[i]->Wait();
if (node->num_eval_reads < num_eval_reads_) {
to_eval_.push_back(node);
}
}
}
void MiniguiGtpClient::WinRateEvaluator::UpdateNodesToEval() {
to_eval_.clear();
for (auto* node : variation_) {
if (node->num_eval_reads < num_eval_reads_) {
to_eval_.push_back(node);
}
}
// Sort the nodes for eval by number of eval reads, breaking ties by the move
// number.
std::sort(to_eval_.begin(), to_eval_.end(),
[](VariationTree::Node* a, VariationTree::Node* b) {
if (a->num_eval_reads != b->num_eval_reads) {
return a->num_eval_reads < b->num_eval_reads;
}
return a->n < b->n;
});
}
MiniguiGtpClient::WinRateEvaluator::Worker::Worker(
std::unique_ptr<Game> game, std::unique_ptr<MctsPlayer> player,
ThreadSafeQueue<VariationTree::Node*>* eval_queue)
: game_(std::move(game)),
player_(std::move(player)),
eval_queue_(eval_queue) {}
MiniguiGtpClient::WinRateEvaluator::Worker::~Worker() {
absl::MutexLock lock(&mutex_);
MG_CHECK(!pending_.has_value());
pending_ = nullptr;
Join();
}
void MiniguiGtpClient::WinRateEvaluator::Worker::Prepare() {
absl::MutexLock lock(&mutex_);
BatchingModelFactory::StartGame(player_->model(), player_->model());
}
void MiniguiGtpClient::WinRateEvaluator::Worker::EvalAsync(
VariationTree::Node* node) {
absl::MutexLock lock(&mutex_);
MG_CHECK(!pending_.has_value());
pending_ = node;
}
void MiniguiGtpClient::WinRateEvaluator::Worker::Run() {
for (;;) {
absl::MutexLock lock(&mutex_);
mutex_.Await(absl::Condition(this, &Worker::has_pending_value));
auto* node = *pending_;
pending_.reset();
if (node == nullptr) {
break;
}
player_->NewGame();
for (auto c : node->GetVariation()) {
MG_CHECK(player_->PlayMove(c));
}
player_->TreeSearch(player_->options().virtual_losses, 1024);
BatchingModelFactory::EndGame(player_->model(), player_->model());
nlohmann::json j = {
{"id", node->id},
{"n", player_->root()->N()},
{"q", GetBestMoveQ(player_->root())},
};
MG_LOG(INFO) << "mg-update:" << j.dump();
node->num_eval_reads = player_->root()->N();
eval_queue_->Push(node);
}
}
} // namespace minigo