Repository navigation
Expand file tree
/
Copy pathposition.ts
More file actions
260 lines (233 loc) · 6.77 KB
/
Copy pathposition.ts
File metadata and controls
260 lines (233 loc) · 6.77 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
// 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.
import {Color, Move, N, Nullable, Point, moveIsPoint, movesEqual, otherColor, stonesEqual, toGtp} from './base'
import * as util from './util'
interface Annotation {
p: Point;
label: string;
colors: string[];
}
class Position {
id: string;
parent: Nullable<Position> = null;
stones: Color[];
lastMove: Nullable<Move> = null;
toPlay: Color;
gameOver: boolean;
isMainLine = true;
n = 0;
q: Nullable<number> = null;
moveNum: number;
// A map of variations.
// The principal variation is keyed by "pv".
// The current live tree search is keyed by "live".
// All other variations are keyed by their GTP string.
variations = new Map<string, Position.Variation>();
annotations: Annotation[] = [];
childN: Nullable<number[]> = null;
childQ: Nullable<number[]> = null;
// children[0] is the main line. Subsequent children are variations.
children: Position[] = [];
// captures[0] is the number of stones that black has captured.
// captures[1] is the number of stones that white has captured.
captures: number[] = [0, 0];
comment = "";
treeStats: Position.TreeStats = {
numNodes: 0,
numLeafNodes: 0,
maxDepth: 0,
}
constructor(j: Position.Definition) {
this.id = j.id;
this.moveNum = j.moveNum;
this.toPlay = util.parseColor(j.toPlay);
this.stones = [];
if (j.stones !== undefined) {
const stoneMap: {[index: string]: Color} = {
'.': Color.Empty,
'X': Color.Black,
'O': Color.White,
};
for (let i = 0; i < N * N; ++i) {
this.stones.push(stoneMap[j.stones[i]]);
}
} else {
for (let i = 0; i < N * N; ++i) {
this.stones.push(Color.Empty);
}
}
if (j.move) {
this.lastMove = util.parseMove(j.move);
}
this.gameOver = j.gameOver || false;
this.moveNum = j.moveNum;
if (j.comment) {
this.comment = j.comment;
}
if (j.caps !== undefined) {
this.captures[0] = j.caps[0];
this.captures[1] = j.caps[1];
}
if (moveIsPoint(this.lastMove)) {
this.annotations.push({
p: this.lastMove,
label: "●",
colors: ['#ef6c02'],
});
}
}
addChild(p: Position) {
if (p.lastMove == null) {
throw new Error('Child nodes shouldn\'t have a null lastMove');
}
if (p.parent != null) {
throw new Error('Node already has a parent');
}
// If the position already has a child with the given move, verify that the
// stones are equal and return the existing child.
for (let child of this.children) {
if (movesEqual(child.lastMove, p.lastMove)) {
throw new Error(`Position already has child ${toGtp(p.lastMove)}`);
}
}
// Create a new child.
p.isMainLine = this.isMainLine && this.children.length == 0;
p.parent = this;
// If it is not on the main line, prepare the move number annotations.
if (! p.isMainLine) {
let result: Move[] = [];
let node: Nullable<Position>
for (node = p; node && !node.isMainLine; node = node.parent) {
if (node.lastMove == null) { break; }
}
result.reverse();
let playedCount = new Uint16Array(N * N);
for (let i=0; i < result.length - 1; ++i) {
let move = result[i];
if (moveIsPoint(move)) {
let idx = move.row * N + move.col;
let count = ++playedCount[idx];
if (count != 1) {
continue;
}
p.annotations.push({
p: move, // 'p' here for 'point'.
label: (i+1).toString(),
colors: ['#999999'],
});
}
}
}
this.children.push(p);
}
getChild(move: Move) {
for (let child of this.children) {
if (movesEqual(child.lastMove, move)) {
return child;
}
}
return null;
}
update(update: Position.Update) {
if (update.comment !== undefined) { this.comment = update.comment; }
if (update.n !== undefined) { this.n = update.n; }
if (update.q !== undefined) { this.q = update.q; }
if (update.childN !== undefined) { this.childN = update.childN; }
if (update.childQ !== undefined) {
this.childQ = [];
for (let q of update.childQ) { this.childQ.push(q / 1000); }
}
if (update.treeStats !== undefined) { this.treeStats = update.treeStats; }
if (update.variations !== undefined) {
this.variations.clear();
let pv: Nullable<Position.Variation> = null;
for (let key in update.variations) {
let variation = {
n: update.variations[key].n,
q: update.variations[key].q,
moves: util.parseMoves(update.variations[key].moves),
};
this.variations.set(key, variation);
if (pv == null || variation.n > pv.n) {
pv = variation;
}
}
if (pv != null) {
this.variations.set("pv", pv);
}
}
}
// Returns a copy of the complete variation that this position is a part of,
// starting from the root, down to the last move in the line.
// The varation of the root node is its main line.
getFullLine() {
// Get all ancestors.
let result: Position[] = [];
let node: Nullable<Position>
for (node = this.parent; node != null; node = node.parent) {
result.push(node);
}
result.reverse();
// Append descendants.
for (node = this; node != null; node = node.children[0]) {
result.push(node);
}
return result;
}
}
namespace Position {
// Definition of a Position
export interface Definition {
id: string;
parentId?: string;
moveNum: number;
toPlay: string;
stones?: string;
gameOver?: boolean;
move?: string;
comment?: string;
caps?: number[];
}
export interface Variation {
n: number;
q: number;
moves: Move[];
};
export interface TreeStats {
numNodes: number;
numLeafNodes: number;
maxDepth: number;
}
export interface Update {
id: string;
comment?: string;
n?: number;
q?: number;
childN?: number[];
childQ?: number[];
treeStats?: TreeStats;
variations?: {
[index:string]: {
n: number;
q: number;
moves: string[];
}
};
}
}
export {
Annotation,
Position,
};