-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpiece.cpp
172 lines (151 loc) · 2.43 KB
/
piece.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
#include "square.hpp"
#include "piece.hpp"
#include <string>
using namespace std;
string piece::getName()
{
string a;
if(isWhite) a="1";
else a="0";
return name + a;
}
bool piece::checkMove(square a, square b)
{
return false;
}
bool piece::event()
{
return false;
}
void piece::setEvent()
{
}
king::king(bool w)
{
hasMoved=false;
isWhite=w;
name="K";
}
queen::queen(bool w)
{
isWhite=w;
name="Q";
}
knight::knight(bool w)
{
isWhite=w;
name="N";
}
bishop::bishop(bool w)
{
isWhite=w;
name="B";
}
pawn::pawn(bool w)
{
bool lastMove;
isWhite=w;
name="P";
}
rook::rook(bool w)
{
hasMoved=false;
isWhite=w;
name="R";
}
bool king::checkMove(square a, square b)
{
if(a.name == b.name) return false;
int t1=a.name[0]-b.name[0];
int t2=a.name[1]-b.name[1];
if(t1==2 && t2==0 && hasMoved==false)
return true;
if(t1<=1 && t1>=-1 && t2<=1 && t2>=-1)
return true;
return false;
}
bool king::event()
{
return !hasMoved;
}
void king::setEvent()
{
hasMoved=true;
}
bool queen::checkMove(square a, square b)
{
if(a.name == b.name) return false;
int t1=a.name[0]-b.name[0];
int t2=a.name[1]-b.name[1];
if(t1<0) t1=-t1;
if(t2<0) t2=-t2;
if(t1==t2 || t1==0 || t2==0) return true;
return false;
}
bool knight::checkMove(square a, square b)
{
if(a.name == b.name) return false;
int t1=a.name[0]-b.name[0];
int t2=a.name[1]-b.name[1];
if(t1<0) t1=-t1;
if(t2<0) t2=-t2;
if((t1==1 && t2==2) || (t1==2 && t2==1)) return true;
return false;
}
bool bishop::checkMove(square a, square b)
{
if(a.name == b.name) return false;
int t1=a.name[0]-b.name[0];
int t2=a.name[1]-b.name[1];
if(t1<0) t1=-t1;
if(t2<0) t2=-t2;
if(t1==t2) return true;
return false;
}
bool pawn::checkMove(square a, square b)
{
if(a.name == b.name) return false;
int t1=a.name[0]-b.name[0];
int t2=a.name[1]-b.name[1];
if(t2>2) return false;
if(isWhite==true)
{
if(a.name[1]=='2' && b.name[1]=='4' && t1==0)
return true;
if(t2==-1 && t1<2 && t1>-2)
return true;
}
else
{
if(a.name[1]=='7' && b.name[1]=='5' && t1==0)
return true;
if(t2==1 && t1<2 && t1>-2)
return true;
}
return false;
}
bool pawn::event()
{
return lastMove;
}
void pawn::setEvent()
{
lastMove=true;
}
bool rook::checkMove(square a, square b)
{
if(a.name == b.name) return false;
int t1=a.name[0]-b.name[0];
int t2=a.name[1]-b.name[1];
if(t1==0 || t2==0)
return true;
return false;
}
bool rook::event()
{
return !hasMoved;
}
void rook::setEvent()
{
hasMoved=true;
}