/
attack.c
76 lines (62 loc) · 1.61 KB
/
attack.c
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
#include "defs.h"
#include "stdio.h"
const int KnDir[8] = { -8, -19, -21, -12, 8, 19, 21, 12 };
const int RkDir[4] = { -1, -10, 1, 10 };
const int BiDir[4] = { -9, -11, 11, 9 };
const int KiDir[8] = { -1, -10, 1, 10, -9, -11, 11, 9 };
int SqAttacked(const int sq, const int side, const S_BOARD *pos) {
int piece;
int tmpSQ;
int dir;
int i;
ASSERT(SqOnBoard(sq));
ASSERT(SideValid(side));
ASSERT(checkBoard(pos));
//pawn attacks
if(side == WHITE) {
if(pos->pieces[sq-11] == wP || pos->pieces[sq-9] == wP) return TRUE;
} else { //BLACK
if(pos->pieces[sq+11] == bP || pos->pieces[sq+9] == bP) return TRUE;
}
//knight attacks
for(i = 0; i < 8; i++) {
piece = pos->pieces[ sq + KnDir[i] ];
if(piece != OFFBOARD && IsKn(piece) && PieceColor[piece]==side) return TRUE;
}
//king attacks
for(i = 0; i < 8; i++) {
piece = pos->pieces[ sq + KiDir[i] ];
if(piece != OFFBOARD && IsKi(piece) && PieceColor[piece]==side) {
return TRUE;
}
}
//rook and Queen attacks
for(i = 0; i < 4; i++) {
dir = RkDir[i];
tmpSQ = sq + dir;
piece = pos->pieces[tmpSQ];
while(piece != OFFBOARD) {
if(piece != EMPTY) {
if(piece != OFFBOARD && IsRQ(piece) && PieceColor[piece] == side) return TRUE;
break;
}
tmpSQ += dir;
piece = pos->pieces[tmpSQ];
}
}
//bishop and queen attacks
for(i = 0; i < 4; i++) {
dir = BiDir[i];
tmpSQ = sq + dir;
piece = pos->pieces[tmpSQ];
while(piece != OFFBOARD) {
if(piece != EMPTY) {
if(piece != OFFBOARD && IsBQ(piece) && PieceColor[piece] == side) return TRUE;
break;
}
tmpSQ += dir;
piece = pos->pieces[tmpSQ];
}
}
return FALSE;
}