-
Notifications
You must be signed in to change notification settings - Fork 1k
/
UCTNode.cpp
493 lines (413 loc) · 14.3 KB
/
UCTNode.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
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
/*
This file is part of Leela Zero.
Copyright (C) 2017-2019 Gian-Carlo Pascutto
Leela Zero 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.
Leela Zero 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 Leela Zero. If not, see <http://www.gnu.org/licenses/>.
Additional permission under GNU GPL version 3 section 7
If you modify this Program, or any covered work, by linking or
combining it with NVIDIA Corporation's libraries from the
NVIDIA CUDA Toolkit and/or the NVIDIA CUDA Deep Neural
Network library and/or the NVIDIA TensorRT inference library
(or a modified version of those libraries), containing parts covered
by the terms of the respective license agreement, the licensors of
this Program grant you additional permission to convey the resulting
work.
*/
#include "config.h"
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <vector>
#include "UCTNode.h"
#include "FastBoard.h"
#include "FastState.h"
#include "GTP.h"
#include "GameState.h"
#include "Network.h"
#include "Utils.h"
using namespace Utils;
UCTNode::UCTNode(const int vertex, const float policy)
: m_move(vertex), m_policy(policy) {}
bool UCTNode::first_visit() const {
return m_visits == 0;
}
bool UCTNode::create_children(Network& network, std::atomic<int>& nodecount,
const GameState& state, float& eval,
const float min_psa_ratio) {
// no successors in final state
if (state.get_passes() >= 2) {
return false;
}
// acquire the lock
if (!acquire_expanding()) {
return false;
}
// can we actually expand?
if (!expandable(min_psa_ratio)) {
expand_done();
return false;
}
NNCache::Netresult raw_netlist;
try {
raw_netlist =
network.get_output(&state, Network::Ensemble::RANDOM_SYMMETRY);
} catch (NetworkHaltException&) {
expand_cancel();
throw;
}
// DCNN returns winrate as side to move
const auto stm_eval = raw_netlist.winrate;
const auto to_move = state.board.get_to_move();
// our search functions evaluate from black's point of view
if (to_move == FastBoard::WHITE) {
m_net_eval = 1.0f - stm_eval;
} else {
m_net_eval = stm_eval;
}
eval = m_net_eval;
std::vector<Network::PolicyVertexPair> nodelist;
auto legal_sum = 0.0f;
for (auto i = 0; i < NUM_INTERSECTIONS; i++) {
const auto x = i % BOARD_SIZE;
const auto y = i / BOARD_SIZE;
const auto vertex = state.board.get_vertex(x, y);
if (state.is_move_legal(to_move, vertex)) {
nodelist.emplace_back(raw_netlist.policy[i], vertex);
legal_sum += raw_netlist.policy[i];
}
}
// Always try passes if we're not trying to be clever.
auto allow_pass = cfg_dumbpass;
// Less than 20 available intersections in a 19x19 game.
if (int(nodelist.size()) <= std::max(5, BOARD_SIZE)) {
allow_pass = true;
}
// If we're clever, only try passing if we're winning on the
// net score and on the board count.
if (!allow_pass && stm_eval > 0.8f) {
const auto relative_score =
(to_move == FastBoard::BLACK ? 1 : -1) * state.final_score();
if (relative_score >= 0) {
allow_pass = true;
}
}
if (allow_pass) {
nodelist.emplace_back(raw_netlist.policy_pass, FastBoard::PASS);
legal_sum += raw_netlist.policy_pass;
}
if (legal_sum > std::numeric_limits<float>::min()) {
// re-normalize after removing illegal moves.
for (auto& node : nodelist) {
node.first /= legal_sum;
}
} else {
// This can happen with new randomized nets.
auto uniform_prob = 1.0f / nodelist.size();
for (auto& node : nodelist) {
node.first = uniform_prob;
}
}
link_nodelist(nodecount, nodelist, min_psa_ratio);
if (first_visit()) {
// Increment visit and assign eval.
update(eval);
}
expand_done();
return true;
}
void UCTNode::link_nodelist(std::atomic<int>& nodecount,
std::vector<Network::PolicyVertexPair>& nodelist,
const float min_psa_ratio) {
assert(min_psa_ratio < m_min_psa_ratio_children);
if (nodelist.empty()) {
return;
}
// Use best to worst order, so highest go first
std::stable_sort(rbegin(nodelist), rend(nodelist));
const auto max_psa = nodelist[0].first;
const auto old_min_psa = max_psa * m_min_psa_ratio_children;
const auto new_min_psa = max_psa * min_psa_ratio;
if (new_min_psa > 0.0f) {
m_children.reserve(std::count_if(
cbegin(nodelist), cend(nodelist),
[=](const auto& node) { return node.first >= new_min_psa; }));
} else {
m_children.reserve(nodelist.size());
}
auto skipped_children = false;
for (const auto& node : nodelist) {
if (node.first < new_min_psa) {
skipped_children = true;
} else if (node.first < old_min_psa) {
m_children.emplace_back(node.second, node.first);
++nodecount;
}
}
m_min_psa_ratio_children = skipped_children ? min_psa_ratio : 0.0f;
}
const std::vector<UCTNodePointer>& UCTNode::get_children() const {
return m_children;
}
int UCTNode::get_move() const {
return m_move;
}
void UCTNode::virtual_loss() {
m_virtual_loss += VIRTUAL_LOSS_COUNT;
}
void UCTNode::virtual_loss_undo() {
m_virtual_loss -= VIRTUAL_LOSS_COUNT;
}
void UCTNode::update(const float eval) {
// Cache values to avoid race conditions.
auto old_eval = static_cast<float>(m_blackevals);
auto old_visits = static_cast<int>(m_visits);
auto old_delta = old_visits > 0 ? eval - old_eval / old_visits : 0.0f;
m_visits++;
accumulate_eval(eval);
auto new_delta = eval - (old_eval + eval) / (old_visits + 1);
// Welford's online algorithm for calculating variance.
auto delta = old_delta * new_delta;
atomic_add(m_squared_eval_diff, delta);
}
bool UCTNode::has_children() const {
return m_min_psa_ratio_children <= 1.0f;
}
bool UCTNode::expandable(const float min_psa_ratio) const {
#ifndef NDEBUG
if (m_min_psa_ratio_children == 0.0f) {
// If we figured out that we are fully expandable
// it is impossible that we stay in INITIAL state.
assert(m_expand_state.load() != ExpandState::INITIAL);
}
#endif
return min_psa_ratio < m_min_psa_ratio_children;
}
float UCTNode::get_policy() const {
return m_policy;
}
void UCTNode::set_policy(const float policy) {
m_policy = policy;
}
float UCTNode::get_eval_variance(const float default_var) const {
return m_visits > 1 ? m_squared_eval_diff / (m_visits - 1) : default_var;
}
int UCTNode::get_visits() const {
return m_visits;
}
float UCTNode::get_eval_lcb(const int color) const {
// Lower confidence bound of winrate.
auto visits = get_visits();
if (visits < 2) {
// Return large negative value if not enough visits.
return -1e6f + visits;
}
auto mean = get_raw_eval(color);
auto stddev = std::sqrt(get_eval_variance(1.0f) / visits);
auto z = cached_t_quantile(visits - 1);
return mean - z * stddev;
}
float UCTNode::get_raw_eval(const int tomove, const int virtual_loss) const {
auto visits = get_visits() + virtual_loss;
assert(visits > 0);
auto blackeval = get_blackevals();
if (tomove == FastBoard::WHITE) {
blackeval += static_cast<double>(virtual_loss);
}
auto eval = static_cast<float>(blackeval / double(visits));
if (tomove == FastBoard::WHITE) {
eval = 1.0f - eval;
}
return eval;
}
float UCTNode::get_eval(const int tomove) const {
// Due to the use of atomic updates and virtual losses, it is
// possible for the visit count to change underneath us. Make sure
// to return a consistent result to the caller by caching the values.
return get_raw_eval(tomove, m_virtual_loss);
}
float UCTNode::get_net_eval(const int tomove) const {
if (tomove == FastBoard::WHITE) {
return 1.0f - m_net_eval;
}
return m_net_eval;
}
double UCTNode::get_blackevals() const {
return m_blackevals;
}
void UCTNode::accumulate_eval(const float eval) {
atomic_add(m_blackevals, double(eval));
}
UCTNode* UCTNode::uct_select_child(const int color, const bool is_root) {
wait_expanded();
// Count parentvisits manually to avoid issues with transpositions.
auto total_visited_policy = 0.0f;
auto parentvisits = size_t{0};
for (const auto& child : m_children) {
if (child.valid()) {
parentvisits += child.get_visits();
if (child.get_visits() > 0) {
total_visited_policy += child.get_policy();
}
}
}
const auto numerator = std::sqrt(
double(parentvisits)
* std::log(cfg_logpuct * double(parentvisits) + cfg_logconst));
const auto fpu_reduction =
(is_root ? cfg_fpu_root_reduction : cfg_fpu_reduction)
* std::sqrt(total_visited_policy);
// Estimated eval for unknown nodes = parent (not NN) eval - reduction
const auto fpu_eval = get_raw_eval(color) - fpu_reduction;
auto best = static_cast<UCTNodePointer*>(nullptr);
auto best_value = std::numeric_limits<double>::lowest();
for (auto& child : m_children) {
if (!child.active()) {
continue;
}
auto winrate = fpu_eval;
if (child.is_inflated()
&& child->m_expand_state.load() == ExpandState::EXPANDING) {
// Someone else is expanding this node, never select it
// if we can avoid so, because we'd block on it.
winrate = -1.0f - fpu_reduction;
} else if (child.get_visits() > 0) {
winrate = child.get_eval(color);
}
const auto psa = child.get_policy();
const auto denom = 1.0 + child.get_visits();
const auto puct = cfg_puct * psa * (numerator / denom);
const auto value = winrate + puct;
assert(value > std::numeric_limits<double>::lowest());
if (value > best_value) {
best_value = value;
best = &child;
}
}
assert(best != nullptr);
best->inflate();
return best->get();
}
class NodeComp
: public std::binary_function<UCTNodePointer&, UCTNodePointer&, bool> {
public:
NodeComp(const int color, const float lcb_min_visits)
: m_color(color), m_lcb_min_visits(lcb_min_visits) {}
// WARNING : on very unusual cases this can be called on multithread
// contexts (e.g., UCTSearch::get_pv()) so beware of race conditions
bool operator()(const UCTNodePointer& a, const UCTNodePointer& b) {
auto a_visit = a.get_visits();
auto b_visit = b.get_visits();
// Need at least 2 visits for LCB.
if (m_lcb_min_visits < 2) {
m_lcb_min_visits = 2;
}
// Calculate the lower confidence bound for each node.
if ((a_visit > m_lcb_min_visits) && (b_visit > m_lcb_min_visits)) {
auto a_lcb = a.get_eval_lcb(m_color);
auto b_lcb = b.get_eval_lcb(m_color);
// Sort on lower confidence bounds
if (a_lcb != b_lcb) {
return a_lcb < b_lcb;
}
}
// if visits are not same, sort on visits
if (a_visit != b_visit) {
return a_visit < b_visit;
}
// neither has visits, sort on policy prior
if (a_visit == 0) {
return a.get_policy() < b.get_policy();
}
// both have same non-zero number of visits
return a.get_eval(m_color) < b.get_eval(m_color);
}
private:
int m_color;
float m_lcb_min_visits;
};
void UCTNode::sort_children(const int color, const float lcb_min_visits) {
std::stable_sort(rbegin(m_children), rend(m_children),
NodeComp(color, lcb_min_visits));
}
UCTNode& UCTNode::get_best_root_child(const int color) const {
wait_expanded();
assert(!m_children.empty());
auto max_visits = 0;
for (const auto& node : m_children) {
max_visits = std::max(max_visits, node.get_visits());
}
auto ret =
std::max_element(begin(m_children), end(m_children),
NodeComp(color, cfg_lcb_min_visit_ratio * max_visits));
ret->inflate();
return *(ret->get());
}
size_t UCTNode::count_nodes_and_clear_expand_state() {
auto nodecount = size_t{0};
nodecount += m_children.size();
if (expandable()) {
m_expand_state = ExpandState::INITIAL;
}
for (auto& child : m_children) {
if (child.is_inflated()) {
nodecount += child->count_nodes_and_clear_expand_state();
}
}
return nodecount;
}
void UCTNode::invalidate() {
m_status = INVALID;
}
void UCTNode::set_active(const bool active) {
if (valid()) {
m_status = active ? ACTIVE : PRUNED;
}
}
bool UCTNode::valid() const {
return m_status != INVALID;
}
bool UCTNode::active() const {
return m_status == ACTIVE;
}
bool UCTNode::acquire_expanding() {
auto expected = ExpandState::INITIAL;
auto newval = ExpandState::EXPANDING;
return m_expand_state.compare_exchange_strong(expected, newval);
}
void UCTNode::expand_done() {
auto v = m_expand_state.exchange(ExpandState::EXPANDED);
#ifdef NDEBUG
(void)v;
#endif
assert(v == ExpandState::EXPANDING);
}
void UCTNode::expand_cancel() {
auto v = m_expand_state.exchange(ExpandState::INITIAL);
#ifdef NDEBUG
(void)v;
#endif
assert(v == ExpandState::EXPANDING);
}
void UCTNode::wait_expanded() const {
while (m_expand_state.load() == ExpandState::EXPANDING) {}
auto v = m_expand_state.load();
#ifdef NDEBUG
(void)v;
#endif
assert(v == ExpandState::EXPANDED);
}