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
|
#include <stdio.h>
#include <memory.h>
#include <stdlib.h>
#include <cstdint>
#include <strings.h>
typedef struct
{
char fen[100];
int leftFenNumber;
int rightFenNumber;
int leftEval;
char leftMove[10];
int leftRank;
int rightEval;
char rightMove[10];
int rightRank;
} position_t;
position_t *gPosition = NULL;
int gPositions;
void StripTrailingNewline(char *str)
{
int sl = strlen(str);
if (sl == 0)
return;
if (str[sl - 1] == '\n')
str[sl - 1] = 0;
}
uint32_t MyHashString(const char *s)
{
uint32_t hash = 2166136261u;
while (*s)
{
hash ^= (unsigned char)*s++;
hash *= 16777619u;
}
return hash;
}
// Evals are normally plain centipawn integers (e.g. "35", "-120"), but some
// engines print mate scores as "+MATE10" / "-MATE3" instead of a number.
// Convert those into a large-magnitude centipawn value (sign-preserved,
// shorter mates score more extreme) so they still sort correctly and don't
// get dropped by atoi() silently returning 0.
int ParseEval(const char *s)
{
int sign = 1;
const char *p = s;
while (*p == ' ' || *p == '\t')
p++;
if (*p == '+')
p++;
else if (*p == '-')
{
sign = -1;
p++;
}
if (!strncasecmp(p, "MATE", 4))
{
int pliesToMate = atoi(p + 4);
if (pliesToMate <= 0)
pliesToMate = 1;
return sign * (32767 - pliesToMate);
}
return atoi(s);
}
int CompareLeftEvals(const void *a, const void *b)
{
position_t *pa = (position_t *)a;
position_t *pb = (position_t *)b;
if (pa->leftEval == pb->leftEval)
return pa->leftFenNumber - pb->leftFenNumber;
return pb->leftEval - pa->leftEval;
}
int CompareRightEvals(const void *a, const void *b)
{
position_t *pa = (position_t *)a;
position_t *pb = (position_t *)b;
if (pa->rightEval == pb->rightEval)
return pa->rightFenNumber - pb->rightFenNumber;
return pb->rightEval - pa->rightEval;
}
void PrintCorrelation()
{
double accuracy;
double totalAccuracy = 0;
double sameMove = 0;
int i;
for (i = 0; i < gPositions; ++i)
{
accuracy = abs(gPosition[i].leftRank - gPosition[i].rightRank);
accuracy /= (double)gPositions;
accuracy = 1.0 - accuracy;
totalAccuracy += accuracy;
if (gPosition[i].leftMove[0] != 0 &&
!strcmp(gPosition[i].leftMove, gPosition[i].rightMove))
sameMove += 1.0;
}
printf(" Positions: %d\n", gPositions);
printf(" Eval correlation: %0.3f percent\n", (totalAccuracy / (double)gPositions) * 100.0);
printf(" Move correlation: %0.3f percent\n", (sameMove / (double)gPositions) * 100.0);
}
void StoreFileEval(char *fen, int fenNumber, int eval, char *moveString, bool isLeftFile)
{
int fenHash = (int)MyHashString(fen);
int i;
i = abs(fenHash) % 1500000;
for (;;)
{
if (gPosition[i].fen[0] == 0)
{
strcpy(gPosition[i].fen, fen);
break;
}
if (!strcmp(gPosition[i].fen, fen))
break;
i++;
}
if (isLeftFile)
{
gPosition[i].leftFenNumber = fenNumber;
gPosition[i].leftEval = eval;
strcpy(gPosition[i].leftMove, moveString);
}
else
{
gPosition[i].rightFenNumber = fenNumber;
gPosition[i].rightEval = eval;
strcpy(gPosition[i].rightMove, moveString);
}
}
void ReadFileEvals(const char *fileName, bool isLeftFile)
{
FILE *f;
char fenLine[1000 + 1];
char evalLine[1000 + 1];
char moveLine[1000 + 1];
int fenNumber;
f = fopen(fileName, "r");
if (!f)
{
printf("Couldn't open %s.\n", fileName);
exit(1);
}
fenNumber = 0;
for (;;)
{
fenLine[0] = 0;
evalLine[0] = 0;
moveLine[0] = 0;
fgets(fenLine, 1000, f);
fgets(evalLine, 1000, f);
fgets(moveLine, 1000, f);
if (fenLine[0] == 0 || evalLine[0] == 0 || moveLine[0] == 0)
break;
StripTrailingNewline(fenLine);
StripTrailingNewline(evalLine);
StripTrailingNewline(moveLine);
StoreFileEval(fenLine, fenNumber, ParseEval(evalLine), moveLine, isLeftFile);
fenNumber++;
}
fclose(f);
}
void CompareLopFiles(const char *leftFile, const char *rightFile)
{
int i;
printf("Comparing %s to %s:\n", leftFile, rightFile);
fflush(stdout);
if (gPosition)
free(gPosition);
gPosition = (position_t *)malloc(2000000 * sizeof(position_t));
gPositions = 0;
for (i = 0; i < 2000000; ++i)
{
gPosition[i].fen[0] = 0;
gPosition[i].leftEval = -1000000;
gPosition[i].rightEval = -1000000;
}
ReadFileEvals(leftFile, true);
ReadFileEvals(rightFile, false);
position_t *oldPosition = gPosition;
gPosition = (position_t *)malloc(2000000 * sizeof(position_t));
gPositions = 0;
for (i = 0; i < 2000000; ++i)
{
if (oldPosition[i].fen[0] == 0 ||
oldPosition[i].leftEval == -1000000 ||
oldPosition[i].rightEval == -1000000)
continue;
gPosition[gPositions++] = oldPosition[i];
}
free(oldPosition);
qsort(gPosition, gPositions, sizeof(position_t), CompareLeftEvals);
for (i = 0; i < gPositions; ++i)
gPosition[i].leftRank = i;
qsort(gPosition, gPositions, sizeof(position_t), CompareRightEvals);
for (i = 0; i < gPositions; ++i)
gPosition[i].rightRank = i;
PrintCorrelation();
free(gPosition);
gPosition = NULL;
}
int main(int argc, char *argv[])
{
char leftFile[1000 + 1];
char rightFile[1000 + 1];
/*strcpy(leftFile, "lop_10k_lc0_nosearch.txt");
strcpy(rightFile, "lop_10k_sf.txt");
CompareLopFiles(leftFile, rightFile);
return 0;*/
if (argc != 3)
{
printf("Usage: compare_lop file_one.txt file_two.txt\n");
exit(1);
}
strcpy(leftFile, argv[1]);
strcpy(rightFile, argv[2]);
CompareLopFiles(leftFile, rightFile);
return 0;
}
|
