/
test.cpp
292 lines (266 loc) · 11.3 KB
/
test.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
/*
hayabusa, chess engine
Copyright (C) 2009-2010 Gunther Piez
This program 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.
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "test.h"
#include "game.h"
#include "testpositions.h"
#include "hayabusa.h"
#include "jobs.h"
#include "game.tcc"
#include "generateMoves.tcc"
#include "transpositiontable.tcc"
#include "board.tcc"
#include "sortedmovelist.h"
#include <sched.h>
static inline uint64_t readtsc() {
uint64_t a, d;
asm volatile("rdtsc" : "=a" (a), "=d" (d) :: "%rbx", "%rcx");
return a + (d << 32); }
void TestRootBoard::initTestCase() {
qRegisterMetaType<std::string>("std::string");
Board::initTables();
StringList args;
char* unittest = new char[9];
strcpy(unittest, "unittest");
static char* argv[] = { unittest, NULL };
static int argc = 1;
c = new Hayabusa();
b = c->game; }
void TestRootBoard::cmpMates(std::string bstr, std::string mstr) {
Move ml[256];
Move* good = ml+192;
Move* bad=good;
b->setup(bstr);
b->boards[0].wb.generateMateMoves<false, void>(&good, &bad);
StringList mstrl = split(mstr);
while(good < ml+192) {
std::string res = good++->algebraic();
StringList::iterator i = find(mstrl.begin(), mstrl.end(), res);
if (i!=mstrl.end())
mstrl.erase(i);
else
std::cerr << bstr << ": " << res << " missing mate" << std::endl; }
for (StringList::iterator i = mstrl.begin(); i != mstrl.end(); ++i) {
std::cerr << bstr << ": " << *i << " wrong mate" << std::endl; } }
void TestRootBoard::generateMateMoves() {
cmpMates("/1kp/1p//Q/RK w - -", "a4a8");
cmpMates("6k/R/1R/////K w - -", "b6b8");
cmpMates("K/////1R/R/6k w - -", "b3b1");
cmpMates("5nkn/RR//////K w - -","b7g7");
cmpMates("5nkn/QR//////K w - -", "a7g1 b7g7");
cmpMates("5nkn/RQ//////K w - -", "b7g7 b7g2");
cmpMates("R/5nkn/RQ/////K w - -", "b6g6 b6g1");
cmpMates("R/5nkn/QR/////K w - -", "b6g6");
cmpMates("Q/5nkn/RR/////K w - -", "b6g6");
cmpMates("6k/R/1Q/////K w - -", "b6d8 b6b8");
cmpMates("6k/R/4Q/////K w - -", "e6e8 e6c8");
cmpMates("6k/6pp/4Q/////K w - -", "e6e8");
cmpMates("6k/5ppp/4Q/////K w - -", "e6e8 e6c8");
cmpMates("6k/5pbp/4Q/////K w - -", "");
cmpMates("7k/4r1p1/5p1p/1pp2Q2/1b2B1P1/1P2P2P/5PK1/q7 w - -", "f5c8 f5h7"); }
void TestRootBoard::pieceList() {}
void TestRootBoard::generateCaptures() {
QTextStream xout(stderr);
cpu_set_t mask;
CPU_ZERO( &mask );
CPU_SET( 1, &mask );
if ( sched_setaffinity( 0, sizeof(mask), &mask ) == -1 )
qDebug() << "Could not set CPU Affinity" << endl;
static const unsigned testCases = 200;
static const int iter = 10000;
typedef QVector<uint64_t> Sample;
QVector<Sample> times(testCases, Sample(iter));
QVector<Sample> movetimes(testCases, Sample(iter));
QVector<Sample> captimes(testCases, Sample(iter));
QVector<Sample> b02flood(testCases, Sample(iter));
QVector<Sample> b02point(testCases, Sample(iter));
QVector<Sample> b02double(testCases, Sample(iter));
Move moveList[256];
uint64_t sum=0;
uint64_t movesum=0;
uint64_t nmoves=0;
uint64_t ncap =0;
uint64_t a, d, tsc;
Key blah;
Colors color[testCases];
double cpufreq = 3900.0;
for (unsigned int i = testCases; i;) {
--i;
b->setup(testPositions[i]);
color[i] = b->color;
if (i) {
b->boards[i] = b->boards[0]; }
movetimes[i].reserve(iter*2);
times[i].reserve(iter*2);
captimes[i].reserve(iter*2); }
unsigned op = 1;
const unsigned int iter2 = 10000000;
__v2di res = _mm_set1_epi64x(0);
uint64_t time=0;
#ifdef NDEBUG
for (unsigned int i = 0; i < iter2; ++i) {
Board& bb = b->boards[i & 0xf].wb;
tsc = readtsc();
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build02Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
time += readtsc() - tsc;
// op = fold(res) & 0x3f;
}
std::cout << "build02(pos): " << time/iter2 << " clocks" << std::endl;
time=0;
for (unsigned int i = 0; i < iter2; ++i) {
Board& bb = b->boards[i & 0xf].wb;
tsc = readtsc();
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
res = bb.build13Attack(op);
op = _mm_cvtsi128_si64(res) & 0x3f;
time += readtsc() - tsc; }
std::cout << "build13(pos): " << time/iter2 << " clocks" << std::endl;
// time=0;
// for (unsigned int i = 0; i < iter2; ++i) {
// BoardBase& bb = b->boards[i & 0xf].wb;
// tsc = readtsc();
// res = bb.build02Attack(res);
// time += readtsc() - tsc;
// }
// std::cout << "build02(vector): " << time/iter2 << " clocks" << std::endl;
time=0;
for (unsigned int i = 0; i < iter2; ++i) {
Board& bb = b->boards[i & 0xf].wb;
tsc = readtsc();
res = b->boards[0].wb.build13Attack(res);
res = b->boards[1].wb.build13Attack(res);
res = b->boards[2].wb.build13Attack(res);
res = b->boards[3].wb.build13Attack(res);
res = b->boards[4].wb.build13Attack(res);
res = b->boards[5].wb.build13Attack(res);
res = b->boards[6].wb.build13Attack(res);
res = b->boards[7].wb.build13Attack(res);
time += readtsc() - tsc; }
std::cout << "build13(vector): " << time/iter2 << " clocks" << std::endl;
for (int j = 0; j < iter; ++j) {
nmoves = 0;
ncap=0;
for (unsigned int i = 0; i < testCases; ++i) {
// b->setup(testPositions[i]);
uint64_t overhead;
/*
asm volatile("cpuid\n rdtsc" : "=a" (a), "=d" (d) :: "%rbx", "%rcx");
tsc = (a + (d << 32));
asm volatile("cpuid\n rdtsc" : "=a" (a), "=d" (d) :: "%rbx", "%rcx");
overhead = (a + (d << 32)) - tsc;
*/
overhead = 20;
if (color[i] == White)
b->boards[i].wb.buildAttacks();
else
b->boards[i].bb.buildAttacks();
tsc = readtsc();
Move* good = moveList+192;
Move* bad = good;
if (color[i] == White)
b->boards[i].wb.generateCaptureMoves<AllMoves>(good, bad);
else
b->boards[i].bb.generateCaptureMoves<AllMoves>(good, bad);
ncap += bad - good;
captimes[i][j] = readtsc() - tsc - overhead;
tsc = readtsc();
if (color[i] == White)
b->boards[i].wb.generateNonCap(good, bad);
else
b->boards[i].bb.generateNonCap(good, bad);
nmoves += bad - good;
times[i][j] = readtsc() - tsc - overhead;
for (Move* k=good; k<bad; ++k) {
// std::cout << k->string() << std::endl;
tsc = readtsc();
if (color[i] == White) {
__v8hi est = b->boards[i].b->eval.estimate(wb, *k);
ColoredBoard<Black> bb(b->boards[i].wb, *k, est);
blah += bb.getZobrist(); }
else {
__v8hi est = b->boards[i].b->eval.estimate(bb, *k);
ColoredBoard<White> bb(b->boards[i].bb, *k, est);
blah += bb.getZobrist(); }
movetimes[i][j] += readtsc() - tsc - overhead; }
// std::string empty;
// std::cin >> empty;
} }
for (QVector<Sample>::Iterator i = times.begin(); i != times.end(); ++i) {
qSort(*i);
sum += (*i)[iter / 2]; }
uint64_t capsum=0;
for (QVector<Sample>::Iterator i = captimes.begin(); i != captimes.end(); ++i) {
qSort(*i);
capsum += (*i)[iter / 2]; }
for (QVector<Sample>::Iterator i = movetimes.begin(); i != movetimes.end(); ++i) {
qSort(*i);
movesum += (*i)[iter / 2]; }
xout << endl << nmoves << " Moves, " << sum/nmoves << " Clocks, " << cpufreq* nmoves/sum << " generated Mmoves/s, " << cpufreq* nmoves/movesum << " executed Mmoves/s" << endl;
xout << ncap << " Captures, " << capsum/ncap << " Clocks, " << cpufreq* ncap/capsum << " generated Mmoves/s, " /*<< cpufreq*ncap/movesum << " executed Mmoves/s" */<< endl;
xout << blah + fold(res) + op64 << endl;
#endif
}
// TODO enable perft template in search
void TestRootBoard::perft() {
// Zobrist::test();
b->setup("5n1n/4kPPP/////pppK4/N1N5 w - - 0 1");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<White>(*b, 6));
QCOMPARE( c->getAnswer(), std::string("71179139"));
b->setup("n1n5/PPPk4/8/8/8/8/4Kppp/5N1N b - - 0 1");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<Black>(*b, 6));
QCOMPARE( c->getAnswer(), std::string("71179139"));
b->setup("r3k2r/B1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPB1PPP/R3K2R b KQkq - 0 1");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<Black>(*b, 5));
QCOMPARE( c->getAnswer(), std::string("176577789"));
b->setup("8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - -");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<White>(*b, 7));
QCOMPARE( c->getAnswer(), std::string("178633661"));
b->setup("r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq -");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<White>(*b, 5));
QCOMPARE( c->getAnswer(), std::string("193690690"));
b->setup("rnbqk2r/pppp1Np1/8/2b4p/4P3/8/PPPP1PPP/RNBQKB1R w KQkq - 0 1");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<White>(*b, 6));
QCOMPARE( c->getAnswer(), std::string("1273001810"));
b->setup("4k2r/8/8/8/8/6nB/8/4K2R w Kk - 0 1");
// WorkThread::findFree()->queueJob(0U, new RootPerftJob<White>(*b, 8));
QCOMPARE( c->getAnswer(), std::string("9941334384")); }
//QTEST_APPLESS_MAIN(TestRootBoard);