Repository navigation
Expand file tree
/
Copy pathposition.cc
More file actions
452 lines (409 loc) · 12.3 KB
/
Copy pathposition.cc
File metadata and controls
452 lines (409 loc) · 12.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
// 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 "cc/position.h"
#include <iomanip>
#include <sstream>
#include <utility>
#include "cc/tiny_set.h"
namespace minigo {
namespace {
constexpr char kPrintWhite[] = "\x1b[0;31;47m";
constexpr char kPrintBlack[] = "\x1b[0;31;40m";
constexpr char kPrintEmpty[] = "\x1b[0;31;43m";
constexpr char kPrintNormal[] = "\x1b[0m";
std::array<inline_vector<Coord, 4>, kN* kN> kNeighborCoords = []() {
std::array<inline_vector<Coord, 4>, kN * kN> result;
for (int row = 0; row < kN; ++row) {
for (int col = 0; col < kN; ++col) {
auto& coords = result[row * kN + col];
if (col > 0) {
coords.emplace_back(row, col - 1);
}
if (col < kN - 1) {
coords.emplace_back(row, col + 1);
}
if (row > 0) {
coords.emplace_back(row - 1, col);
}
if (row < kN - 1) {
coords.emplace_back(row + 1, col);
}
}
}
return result;
}();
inline const inline_vector<Coord, 4>& GetNeighborCoords(Coord c) {
return kNeighborCoords[c];
}
} // namespace
Position::Position(BoardVisitor* bv, GroupVisitor* gv, float komi,
Color to_play, int n)
: board_visitor_(bv),
group_visitor_(gv),
to_play_(to_play),
n_(n),
komi_(komi) {}
Position::Position(BoardVisitor* bv, GroupVisitor* gv, const Position& position)
: Position(position) {
board_visitor_ = bv;
group_visitor_ = gv;
}
void Position::PlayMove(Coord c, Color color) {
if (c == Coord::kPass) {
PassMove();
return;
}
if (color == Color::kEmpty) {
color = to_play_;
} else {
to_play_ = color;
}
assert(IsMoveLegal(c));
AddStoneToBoard(c, color);
n_ += 1;
num_consecutive_passes_ = 0;
to_play_ = OtherColor(to_play_);
previous_move_ = c;
}
std::string Position::ToSimpleString() const {
std::ostringstream oss;
for (int row = 0; row < kN; ++row) {
for (int col = 0; col < kN; ++col) {
Coord c(row, col);
auto color = stones_[c].color();
if (color == Color::kWhite) {
oss << "O";
} else if (color == Color::kBlack) {
oss << "X";
} else {
oss << (c == ko_ ? "*" : ".");
}
}
oss << "\n";
}
return oss.str();
}
std::string Position::ToGroupString() const {
std::ostringstream oss;
oss << std::setfill('0') << std::hex;
for (int row = 0; row < kN; ++row) {
for (int col = 0; col < kN; ++col) {
Coord c(row, col);
Stone s = stones_[c];
if (s.empty()) {
oss << kPrintEmpty << ". ";
} else {
oss << (s.color() == Color::kWhite ? kPrintWhite : kPrintBlack);
oss << std::setw(2) << s.group_id() << " ";
}
}
oss << "\n";
}
oss << kPrintNormal;
return oss.str();
}
std::string Position::ToPrettyString() const {
std::ostringstream oss;
auto format_cols = [&oss]() {
oss << " ";
for (int i = 0; i < kN; ++i) {
oss << Coord::kKgsColumns[i] << " ";
}
oss << "\n";
};
format_cols();
for (int row = 0; row < kN; ++row) {
oss << std::setw(2) << (kN - row) << " ";
for (int col = 0; col < kN; ++col) {
Coord c(row, col);
auto color = stones_[c].color();
if (color == Color::kWhite) {
oss << kPrintWhite << "O ";
} else if (color == Color::kBlack) {
oss << kPrintBlack << "X ";
} else {
oss << kPrintEmpty << (c == ko_ ? "* " : ". ");
}
}
oss << kPrintNormal << std::setw(2) << (kN - row);
oss << "\n";
}
format_cols();
return oss.str();
}
void Position::PassMove() {
n_ += 1;
num_consecutive_passes_ += 1;
ko_ = Coord::kInvalid;
to_play_ = OtherColor(to_play_);
previous_move_ = Coord::kPass;
}
void Position::AddStoneToBoard(Coord c, Color color) {
auto potential_ko = IsKoish(c);
auto opponent_color = OtherColor(color);
// Traverse the coord's neighbors, building useful information:
// - list of captured groups (if any).
// - coordinates of the new stone's liberties.
// - set of neighboring groups of each color.
inline_vector<std::pair<GroupId, Coord>, 4> captured_groups;
inline_vector<Coord, 4> liberties;
tiny_set<GroupId, 4> opponent_groups;
tiny_set<GroupId, 4> neighbor_groups;
for (auto nc : GetNeighborCoords(c)) {
auto neighbor = stones_[nc];
auto neighbor_color = neighbor.color();
auto neighbor_group_id = neighbor.group_id();
if (neighbor_color == Color::kEmpty) {
// Remember the coord of this liberty.
liberties.push_back(nc);
} else if (neighbor_color == color) {
// Remember neighboring groups of same color.
neighbor_groups.insert(neighbor_group_id);
} else if (neighbor_color == opponent_color) {
// Decrement neighboring opponent group liberty counts and remember the
// gorups we have captured. We'll remove them from the board shortly.
if (opponent_groups.insert(neighbor_group_id)) {
Group& opponent_group = groups_[neighbor_group_id];
if (--opponent_group.num_liberties == 0) {
captured_groups.emplace_back(neighbor_group_id, nc);
}
}
}
}
// Place the new stone on the board.
if (neighbor_groups.empty()) {
// The stone doesn't connect to any neighboring groups: create a new group.
stones_[c] = {color, groups_.alloc(1, liberties.size())};
} else {
// The stone connects to at least one neighbor: merge it into the first
// group we found.
auto group_id = neighbor_groups[0];
if (neighbor_groups.size() == 1) {
// Only one neighbor: update the group's size and liberty count, being
// careful not to add count coords that were already liberties of the
// group.
Group& group = groups_[group_id];
++group.size;
--group.num_liberties;
for (auto nc : liberties) {
if (!HasNeighboringGroup(nc, group_id)) {
++group.num_liberties;
}
}
stones_[c] = {color, group_id};
} else {
// The stone joins multiple groups, merge them.
// Incrementally updating the merged liberty counts is hard, so we just
// recalculate the merged group's size and liberty count from scratch.
// This is the relatively infrequent slow path.
stones_[c] = {color, group_id};
MergeGroup(c);
for (int i = 1; i < neighbor_groups.size(); ++i) {
groups_.free(neighbor_groups[i]);
}
}
}
// Remove captured groups.
for (const auto& p : captured_groups) {
int num_captured_stones = groups_[p.first].size;
if (color == Color::kBlack) {
num_captures_[0] += num_captured_stones;
} else {
num_captures_[1] += num_captured_stones;
}
RemoveGroup(p.second);
}
// Update ko.
if (captured_groups.size() == 1 &&
groups_[captured_groups[0].first].size == 1 &&
potential_ko == opponent_color) {
ko_ = captured_groups[0].second;
} else {
ko_ = Coord::kInvalid;
}
}
void Position::RemoveGroup(Coord c) {
// Remember the first stone from the group we're about to remove.
auto removed_color = stones_[c].color();
auto other_color = OtherColor(removed_color);
auto removed_group_id = stones_[c].group_id();
group_visitor_->Begin();
board_visitor_->Begin();
board_visitor_->Visit(c);
while (!board_visitor_->Done()) {
c = board_visitor_->Next();
assert(stones_[c].group_id() == removed_group_id);
stones_[c] = {};
tiny_set<GroupId, 4> other_groups;
for (auto nc : GetNeighborCoords(c)) {
auto ns = stones_[nc];
auto neighbor_color = ns.color();
auto neighbor_group_id = ns.group_id();
if (neighbor_color == other_color) {
if (other_groups.insert(neighbor_group_id)) {
++groups_[neighbor_group_id].num_liberties;
}
} else if (neighbor_color == removed_color) {
board_visitor_->Visit(nc);
}
}
}
}
void Position::MergeGroup(Coord c) {
Stone s = stones_[c];
Color color = s.color();
Color opponent_color = OtherColor(color);
Group& group = groups_[s.group_id()];
group.num_liberties = 0;
group.size = 0;
board_visitor_->Begin();
board_visitor_->Visit(c);
while (!board_visitor_->Done()) {
c = board_visitor_->Next();
if (stones_[c].color() == Color::kEmpty) {
++group.num_liberties;
} else {
assert(stones_[c].color() == color);
++group.size;
stones_[c] = s;
for (auto nc : GetNeighborCoords(c)) {
if (stones_[nc].color() != opponent_color) {
// We visit neighboring stones of the same color and empty coords.
// Visiting empty coords through the BoardVisitor API ensures that
// each one is only counted as a liberty once, even if it is
// neighbored by multiple stones in this group.
board_visitor_->Visit(nc);
}
}
}
}
}
Color Position::IsKoish(Coord c) const {
if (!stones_[c].empty()) {
return Color::kEmpty;
}
Color ko_color = Color::kEmpty;
for (Coord nc : GetNeighborCoords(c)) {
Stone s = stones_[nc];
if (s.empty()) {
return Color::kEmpty;
}
if (s.color() != ko_color) {
if (ko_color == Color::kEmpty) {
ko_color = s.color();
} else {
return Color::kEmpty;
}
}
}
return ko_color;
}
bool Position::IsMoveLegal(Coord c) const {
if (c == Coord::kPass) {
return true;
}
if (!stones_[c].empty()) {
return false;
}
if (c == ko_) {
return false;
}
if (IsMoveSuicidal(c, to_play_)) {
return false;
}
return true;
}
bool Position::IsMoveSuicidal(Coord c, Color color) const {
auto other_color = OtherColor(color);
for (auto nc : GetNeighborCoords(c)) {
Stone s = stones_[nc];
if (s.empty()) {
// At least one liberty at nc after playing at c.
return false;
} else if (s.color() == other_color) {
if (groups_[s.group_id()].num_liberties == 1) {
// Will capture opponent group that has a stone at nc.
return false;
}
} else {
if (groups_[s.group_id()].num_liberties > 1) {
// Connecting to a same colored group at nc that has than one liberty.
return false;
}
}
}
return true;
}
bool Position::HasNeighboringGroup(Coord c, GroupId group_id) const {
for (auto nc : GetNeighborCoords(c)) {
Stone s = stones_[nc];
if (!s.empty() && s.group_id() == group_id) {
return true;
}
}
return false;
}
float Position::CalculateScore() {
int score = 0;
static_assert(static_cast<int>(Color::kEmpty) == 0, "Color::kEmpty != 0");
static_assert(static_cast<int>(Color::kBlack) == 1, "Color::kBlack != 1");
static_assert(static_cast<int>(Color::kWhite) == 2, "Color::kWhite != 2");
auto score_empty_area = [this](Coord c) {
int num_visited = 0;
int found_bits = 0;
do {
c = board_visitor_->Next();
++num_visited;
for (auto nc : GetNeighborCoords(c)) {
Color color = stones_[nc].color();
if (color == Color::kEmpty) {
board_visitor_->Visit(nc);
} else {
found_bits |= static_cast<int>(color);
}
}
} while (!board_visitor_->Done());
if (found_bits == 1) {
return num_visited;
} else if (found_bits == 2) {
return -num_visited;
} else {
return 0;
}
};
group_visitor_->Begin();
board_visitor_->Begin();
for (int row = 0; row < kN; ++row) {
for (int col = 0; col < kN; ++col) {
Coord c(row, col);
Stone s = stones_[c];
if (s.empty()) {
if (board_visitor_->Visit(c)) {
// First time visiting this empty coord.
score += score_empty_area(c);
}
} else if (group_visitor_->Visit(s.group_id())) {
// First time visiting this group of stones.
auto size = groups_[s.group_id()].size;
if (s.color() == Color::kBlack) {
score += size;
} else {
score -= size;
}
}
}
}
return static_cast<float>(score) - komi_;
}
} // namespace minigo