-
Notifications
You must be signed in to change notification settings - Fork 0
/
attack.c
87 lines (83 loc) · 2.17 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
77
78
79
80
81
82
83
84
85
86
87
#include "def.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 IsSqAttack(int sq, int side, BOARD* board)
{
ASSERT(sq >= 0 && sq < 120);
ASSERT(CheckBoard(board));
int pce, index, t_sq, dir;
if (board->Pieces[sq] == OFF)
{
return FALSE;
}
// Pawns.
if (side == WHITE)
{
if (board->Pieces[sq - 11] == wP || board->Pieces[sq - 9] == wP)
return TRUE;
}
else
{
if (board->Pieces[sq + 11] == bP || board->Pieces[sq + 9] == bP)
return TRUE;
}
// Knights.
for (index = 0; index < 8; ++index)
{
pce = board->Pieces[sq + KnDir[index]];
if (pce >= wP && pce <= bK && IsKnight[pce] && PceCol[pce] == side)
return TRUE;
}
// Rooks, Queens in rooks(horizontal,vertical) direction.
for (index = 0; index < 4; ++index)
{
dir = RkDir[index];
t_sq = sq + dir;
pce = board->Pieces[t_sq];
while (pce != OFF)
{
if (pce != EMPTY)
{
if (IsRQ[pce] && PceCol[pce] == side)
{
return TRUE;
}
break;
}
t_sq += dir;
pce = board->Pieces[t_sq];
}
}
// Bishops, Queens in Bishop(diagnol) direction.
for (index = 0; index < 4; ++index)
{
dir = BiDir[index];
t_sq = sq + dir;
pce = board->Pieces[t_sq];
while (pce != OFF)
{
if (pce != EMPTY)
{
if (IsBQ[pce] && PceCol[pce] == side)
{
return TRUE;
}
break;
}
t_sq += dir;
pce = board->Pieces[t_sq];
}
}
// Kings are the same as knights with 8 directions.
for (index = 0; index < 8; ++index)
{
pce = board->Pieces[sq + KiDir[index]];
if (pce >= wP && pce <= bK && IsKing[pce] && PceCol[pce] == side)
{
return TRUE;
}
}
return FALSE;
}