Repository navigation
Expand file tree
/
Copy pathgtp.cc
More file actions
134 lines (118 loc) · 5.12 KB
/
Copy pathgtp.cc
File metadata and controls
134 lines (118 loc) · 5.12 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
// 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 <iostream>
#include "absl/memory/memory.h"
#include "absl/strings/str_cat.h"
#include "cc/constants.h"
#include "cc/file/path.h"
#include "cc/gtp_client.h"
#include "cc/init.h"
#include "cc/minigui_gtp_client.h"
#include "cc/model/loader.h"
#include "cc/zobrist.h"
#include "gflags/gflags.h"
// GTP flags.
DEFINE_bool(minigui, false, "Enable Minigui GTP extensions");
// Game options flags.
DEFINE_int32(ponder_limit, 0,
"If non-zero and in GTP mode, the number of times to perform tree "
"search while waiting for the opponent to play.");
DEFINE_bool(courtesy_pass, false,
"If true, always pass if the opponent passes.");
DEFINE_double(resign_threshold, -0.999, "Resign threshold.");
// Tree search flags.
DEFINE_int32(num_readouts, 100,
"Number of readouts to make during tree search for each move.");
DEFINE_int32(virtual_losses, 8,
"Number of virtual losses when running tree search.");
DEFINE_double(value_init_penalty, 0.0,
"New children value initialize penalty.\n"
"child's value = parent's value - value_init_penalty * color, "
"clamped to [-1, 1].\n"
"0 is init-to-parent [default], 2.0 is init-to-loss.\n"
"This behaves similarly to leela's FPU \"First Play Urgency\".");
// Time control flags.
DEFINE_double(seconds_per_move, 0,
"If non-zero, the number of seconds to spend thinking about each "
"move instead of using a fixed number of readouts.");
DEFINE_double(
time_limit, 0,
"If non-zero, the maximum amount of time to spend thinking in a game: we "
"spend seconds_per_move thinking for each move for as many moves as "
"possible before exponentially decaying the amount of time.");
DEFINE_double(decay_factor, 0.98,
"If time_limit is non-zero, the decay factor used to shorten the "
"amount of time spent thinking as the game progresses.");
// Inference flags.
DEFINE_string(device, "",
"Optional ID of the device to run inference on. For TPUs, pass "
"the gRPC address.");
DEFINE_string(model, "", "Path to a minigo model.");
DEFINE_int32(cache_size_mb, 1024,
"Size of the inference cache in MB. Tree reuse in GTP mode is "
"disabled, so cache_size_mb should be non-zero for reasonable "
"performance. Enabling minigui mode requires an inference cache.");
namespace minigo {
namespace {
void Gtp() {
Game::Options game_options;
game_options.resign_threshold = FLAGS_resign_threshold;
MctsPlayer::Options player_options;
player_options.inject_noise = false;
player_options.tree.soft_pick_enabled = false;
player_options.tree.value_init_penalty = FLAGS_value_init_penalty;
player_options.virtual_losses = FLAGS_virtual_losses;
player_options.num_readouts = FLAGS_num_readouts;
player_options.seconds_per_move = FLAGS_seconds_per_move;
player_options.time_limit = FLAGS_time_limit;
player_options.decay_factor = FLAGS_decay_factor;
GtpClient::Options client_options;
client_options.ponder_limit = FLAGS_ponder_limit;
client_options.courtesy_pass = FLAGS_courtesy_pass;
// Disable tree reuse and rely on the inference cache when running in Minigui
// mode: we don't want to pollute the tree when investigating variations.
client_options.tree_reuse = !FLAGS_minigui;
MG_LOG(INFO) << game_options << " " << player_options;
std::shared_ptr<ThreadSafeInferenceCache> inference_cache;
if (FLAGS_cache_size_mb > 0) {
auto capacity = BasicInferenceCache::CalculateCapacity(FLAGS_cache_size_mb);
MG_LOG(INFO) << "Will cache up to " << capacity
<< " inferences, using roughly " << FLAGS_cache_size_mb
<< "MB.\n";
inference_cache = std::make_shared<ThreadSafeInferenceCache>(capacity, 1);
} else {
MG_LOG(WARNING) << "cache_size_mb == 0 results in poor performance in GTP "
"mode because tree reuse is disabled.";
}
std::unique_ptr<GtpClient> client;
if (FLAGS_minigui) {
client = absl::make_unique<MiniguiGtpClient>(
FLAGS_device, std::move(inference_cache), FLAGS_model, game_options,
player_options, client_options);
} else {
client = absl::make_unique<GtpClient>(
FLAGS_device, std::move(inference_cache), FLAGS_model, game_options,
player_options, client_options);
}
client->Run();
}
} // namespace
} // namespace minigo
int main(int argc, char* argv[]) {
minigo::Init(&argc, &argv);
minigo::zobrist::Init(0);
minigo::Gtp();
minigo::ShutdownModelFactories();
return 0;
}