-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpieces.cpp
284 lines (227 loc) · 10.9 KB
/
pieces.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
#include <iostream>
using namespace std;
#include "pieces.h"
#include "constants.h"
#include "lookuptables.h"
map<uint64_t,uint64_t> ** RankAttacks = new map<uint64_t,uint64_t>*[64];
map<uint64_t,uint64_t> ** FileAttacks = new map<uint64_t,uint64_t>*[64];
map<uint64_t,uint64_t> ** DiagAttacksA1H8 = new map<uint64_t,uint64_t>*[64];
map<uint64_t,uint64_t> ** DiagAttacksH1A8 = new map<uint64_t,uint64_t>*[64];
void GlobalLookupTablesInit ( ) {
for(int i = 0; i < 64; i++) {
RankAttacks[i] = new map<uint64_t,uint64_t>;
FileAttacks[i] = new map<uint64_t,uint64_t>;
DiagAttacksA1H8[i] = new map<uint64_t,uint64_t>;
DiagAttacksH1A8[i] = new map<uint64_t,uint64_t>;
}
InitLookupTables(RankAttacks, FileAttacks, DiagAttacksA1H8, DiagAttacksH1A8);
}
Piece::Piece() { }
int Piece::Split ( uint64_t ToSplit, uint64_t * Pieces ) {
int counter = 0;
for(int i = 0; i < 64; i++) {
if((Squares[i]) & ToSplit) {
Pieces[counter++] = Squares[i];
}
}
return counter;
}
int Piece::GetCoordinate ( const uint64_t Position ) const {
int numericPosition = 0;
for(int i = 0; (Position>>i)!=1; i++) {
numericPosition++;
}
return numericPosition;
}
uint64_t & PawnsW::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.WPawns.position; }
uint64_t & PawnsB::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.BPawns.position; }
uint64_t & KnightsW::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.WKnights.position; }
uint64_t & KnightsB::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.BKnights.position; }
uint64_t & BishopsW::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.WBishops.position; }
uint64_t & BishopsB::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.BBishops.position; }
uint64_t & RooksW::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.WRooks.position; }
uint64_t & RooksB::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.BRooks.position; }
uint64_t & QueenW::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.WQueen.position; }
uint64_t & QueenB::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.BQueen.position; }
uint64_t & KingW::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.WKing.position; }
uint64_t & KingB::GetPiece ( Values &ChosenBoard ) { return ChosenBoard.BKing.position; }
uint64_t BishopsW::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t allMoves = 0;
int posNum = GetCoordinate(pieces[n]);
allMoves |= DiagAttacksA1H8[posNum]->find(Board & MaskDiagA1H8[DiagA1H8[posNum]])->second;
allMoves |= DiagAttacksH1A8[posNum]->find(Board & MaskDiagH1A8[DiagH1A8[posNum]])->second;
allMoves ^= (allMoves & WPieces);
validMoves = allMoves;
return validMoves;
}
uint64_t BishopsB::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t allMoves = 0;
int posNum = GetCoordinate(pieces[n]);
allMoves |= DiagAttacksA1H8[posNum]->find(Board & MaskDiagA1H8[DiagA1H8[posNum]])->second;
allMoves |= DiagAttacksH1A8[posNum]->find(Board & MaskDiagH1A8[DiagH1A8[posNum]])->second;
allMoves ^= (allMoves & BPieces);
validMoves = allMoves;
return validMoves;
}
uint64_t RooksW::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t allMoves = 0;
int posNum = GetCoordinate(pieces[n]);
allMoves |= RankAttacks[posNum]->find(Board & MaskRank[Rank[posNum]])->second;
allMoves |= FileAttacks[posNum]->find(Board & MaskFile[File[posNum]])->second;
allMoves ^= (allMoves & WPieces);
validMoves = allMoves;
return validMoves;
}
uint64_t RooksB::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t allMoves = 0;
int posNum = GetCoordinate(pieces[n]);
allMoves |= RankAttacks[posNum]->find(Board & MaskRank[Rank[posNum]])->second;
allMoves |= FileAttacks[posNum]->find(Board & MaskFile[File[posNum]])->second;
allMoves ^= (allMoves & BPieces);
validMoves = allMoves;
return validMoves;
}
uint64_t QueenW::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t allMoves = 0;
int posNum = GetCoordinate(pieces[n]);
allMoves |= RankAttacks[posNum]->find(Board & MaskRank[Rank[posNum]])->second;
allMoves |= FileAttacks[posNum]->find(Board & MaskFile[File[posNum]])->second;
allMoves |= DiagAttacksA1H8[posNum]->find(Board & MaskDiagA1H8[DiagA1H8[posNum]])->second;
allMoves |= DiagAttacksH1A8[posNum]->find(Board & MaskDiagH1A8[DiagH1A8[posNum]])->second;
allMoves ^= (allMoves & WPieces);
validMoves = allMoves;
return validMoves;
}
uint64_t QueenB::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t allMoves = 0;
int posNum = GetCoordinate(pieces[n]);
allMoves |= RankAttacks[posNum]->find(Board & MaskRank[Rank[posNum]])->second;
allMoves |= FileAttacks[posNum]->find(Board & MaskFile[File[posNum]])->second;
allMoves |= DiagAttacksA1H8[posNum]->find(Board & MaskDiagA1H8[DiagA1H8[posNum]])->second;
allMoves |= DiagAttacksH1A8[posNum]->find(Board & MaskDiagH1A8[DiagH1A8[posNum]])->second;
allMoves ^= (allMoves & BPieces);
validMoves = allMoves;
return validMoves;
}
uint64_t KnightsW::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t ValidSquare1, ValidSquare2, ValidSquare3, ValidSquare4;
uint64_t ValidSquare5, ValidSquare6, ValidSquare7, ValidSquare8;
uint64_t ClipFileAB, ClipFileHG;
uint64_t KnightValidMoves;
ClipFileAB = ClearFile[A] & ClearFile[B];
ClipFileHG = ClearFile[H] & ClearFile[G];
ValidSquare1 = (pieces[n] & ClipFileAB) << 6;
ValidSquare2 = (pieces[n] & ClearFile[A]) << 15;
ValidSquare3 = (pieces[n] & ClearFile[H]) << 17;
ValidSquare4 = (pieces[n] & ClipFileHG) << 10;
ValidSquare5 = (pieces[n] & ClipFileHG) >> 6;
ValidSquare6 = (pieces[n] & ClearFile[H]) >> 15;
ValidSquare7 = (pieces[n] & ClearFile[A]) >> 17;
ValidSquare8 = (pieces[n] & ClipFileAB) >> 10;
KnightValidMoves = ValidSquare1 | ValidSquare2 | ValidSquare3 | ValidSquare4 |
ValidSquare5 | ValidSquare6 | ValidSquare7 | ValidSquare8;
validMoves = KnightValidMoves & ~WPieces;
return validMoves;
}
uint64_t KnightsB::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t ValidSquare1, ValidSquare2, ValidSquare3, ValidSquare4;
uint64_t ValidSquare5, ValidSquare6, ValidSquare7, ValidSquare8;
uint64_t ClipFileAB, ClipFileHG;
uint64_t KnightValidMoves;
ClipFileAB = ClearFile[A] & ClearFile[B];
ClipFileHG = ClearFile[H] & ClearFile[G];
ValidSquare1 = (pieces[n] & ClipFileAB) << 6;
ValidSquare2 = (pieces[n] & ClearFile[A]) << 15;
ValidSquare3 = (pieces[n] & ClearFile[H]) << 17;
ValidSquare4 = (pieces[n] & ClipFileHG) << 10;
ValidSquare5 = (pieces[n] & ClipFileHG) >> 6;
ValidSquare6 = (pieces[n] & ClearFile[H]) >> 15;
ValidSquare7 = (pieces[n] & ClearFile[A]) >> 17;
ValidSquare8 = (pieces[n] & ClipFileAB) >> 10;
KnightValidMoves = ValidSquare1 | ValidSquare2 | ValidSquare3 | ValidSquare4 |
ValidSquare5 | ValidSquare6 | ValidSquare7 | ValidSquare8;
validMoves = KnightValidMoves & ~BPieces;
return validMoves;
}
uint64_t KingW::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t ValidSquare1, ValidSquare2, ValidSquare3, ValidSquare4;
uint64_t ValidSquare5, ValidSquare6, ValidSquare7, ValidSquare8;
uint64_t ClipFileH, ClipFileA;
uint64_t KingValidMoves;
ClipFileH = pieces[n] & ClearFile[H];
ClipFileA = pieces[n] & ClearFile[A];
ValidSquare1 = ClipFileH << 7;
ValidSquare2 = pieces[n] << 8;
ValidSquare3 = ClipFileH << 9;
ValidSquare4 = ClipFileH << 1;
ValidSquare5 = ClipFileA >> 7;
ValidSquare6 = pieces[n] >> 8;
ValidSquare7 = ClipFileA >> 9;
ValidSquare8 = ClipFileA >> 1;
KingValidMoves = ValidSquare1 | ValidSquare2 | ValidSquare3 | ValidSquare4 |
ValidSquare5 | ValidSquare6 | ValidSquare7 | ValidSquare8;
validMoves = KingValidMoves & ~WPieces;
return validMoves;
}
uint64_t KingB::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t ValidSquare1, ValidSquare2, ValidSquare3, ValidSquare4;
uint64_t ValidSquare5, ValidSquare6, ValidSquare7, ValidSquare8;
uint64_t ClipFileH, ClipFileA;
uint64_t KingValidMoves;
ClipFileH = pieces[n] & ClearFile[H];
ClipFileA = pieces[n] & ClearFile[A];
ValidSquare1 = ClipFileH << 7;
ValidSquare2 = pieces[n] << 8;
ValidSquare3 = ClipFileH << 9;
ValidSquare4 = ClipFileH << 1;
ValidSquare5 = ClipFileA >> 7;
ValidSquare6 = pieces[n] >> 8;
ValidSquare7 = ClipFileA >> 9;
ValidSquare8 = ClipFileA >> 1;
KingValidMoves = ValidSquare1 | ValidSquare2 | ValidSquare3 | ValidSquare4 |
ValidSquare5 | ValidSquare6 | ValidSquare7 | ValidSquare8;
validMoves = KingValidMoves & ~BPieces;
return validMoves;
}
uint64_t PawnsB::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t moves, attacks;
moves = BPawnMoves(AllPieces, n);
attacks = BPawnAttacks(n);
return moves | (attacks & WPieces);
}
uint64_t PawnsB::BPawnMoves ( uint64_t AllPieces, int n ) {
uint64_t OneStep, TwoSteps, ValidMoves;
OneStep = (pieces[n] >> 8) & ~AllPieces;
TwoSteps = ((OneStep & MaskRank[5]) >> 8) & ~AllPieces;
ValidMoves = OneStep | TwoSteps;
return ValidMoves;
}
uint64_t PawnsB::BPawnAttacks ( int n ) {
uint64_t LeftAttack, RightAttack, AllAttacks, ValidAttacks;
LeftAttack = (pieces[n] & ClearFile[H]) >> 7;
RightAttack = (pieces[n] & ClearFile[A]) >> 9;
AllAttacks = LeftAttack | RightAttack;
ValidAttacks = AllAttacks;
return ValidAttacks;
}
uint64_t PawnsW::AllMoves ( uint64_t AllPieces, uint64_t BPieces, uint64_t WPieces, uint64_t Board, int n ) {
uint64_t moves, attacks;
moves = WPawnMoves(AllPieces, n);
attacks = WPawnAttacks(n);
return moves | (attacks & BPieces);
}
uint64_t PawnsW::WPawnMoves ( uint64_t AllPieces, int n ) {
uint64_t OneStep, TwoSteps, ValidMoves;
OneStep = (pieces[n] << 8) & ~AllPieces;
TwoSteps = ((OneStep & MaskRank[2]) << 8) & ~AllPieces;
ValidMoves = OneStep | TwoSteps;
return ValidMoves;
}
uint64_t PawnsW::WPawnAttacks ( int n ) {
uint64_t LeftAttack, RightAttack, AllAttacks, ValidAttacks;
LeftAttack = (pieces[n] & ClearFile[A]) << 7;
RightAttack = (pieces[n] & ClearFile[H]) << 9;
AllAttacks = LeftAttack | RightAttack;
ValidAttacks = AllAttacks;
return ValidAttacks;
}