-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBishop.cpp
87 lines (78 loc) · 1.7 KB
/
Bishop.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
#include "Bishop.h"
#include<algorithm>
using namespace std;
Bishop::Bishop(Color c, int num1, int num2)
{
colour = c;
symbol = 'B';
row = num1;
column = num2;
occupied = 1;
}
Bishop::Bishop()
{}
bool Bishop::legalsquarestomove(Board& b1, Move& m1, Move& m2)
{
if (m1.row == m2.row || m1.column == m2.column)
return false;
if (leftdiagnolfree(b1, m1, m2) || rightdiagnolfree(b1, m1, m2))
return true;
else
return false;
}
bool Bishop::leftdiagnolfree(Board& b1, Move& m1, Move& m2)
{
int num = abs(m1.row- m2.row);
int row=min(m1.row , m2.row);
int column = min(m1.column, m2.column);
if (column + num == m1.column || column + num == m2.column)
{
if (row == m1.row && column == m1.column || column == m2.column && row == m2.row)
{
for (int i = 1; i < num; i++)
{
if (b1.boardptr[row + i][column + i] != nullptr)
return false;
}
return true;
}
else
return false;
}
else
return false;
}
bool Bishop::rightdiagnolfree(Board& b1, Move& m1, Move& m2)
{
int num = abs(m1.row - m2.row);
int row = max(m1.row, m2.row);
int column = min(m1.column, m2.column);
if (column + num == m1.column || column + num == m2.column)
{
if (row == m1.row && column == m1.column || column == m2.column && row == m2.row)
{
for (int i = 1; i < num; i++)
{
if (b1.boardptr[row - i][column + i] != nullptr)
return false;
}
return true;
}
else
return false;
}
else
return false;
}
bool Bishop::capture(Board& b1, Move& m1, Move& m2)
{
if (m1.colour != m2.colour)
{
if(legalsquarestomove(b1,m1,m2))
return true;
else
return false;
}
else
return false;
}