-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbishop.cpp
More file actions
137 lines (126 loc) · 3.83 KB
/
Copy pathbishop.cpp
File metadata and controls
137 lines (126 loc) · 3.83 KB
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
#include "bishop.h"
using namespace std;
string Bishop::getName(){
return ("Goniec");
}
int Bishop::getleftWhiteStartRow(){
return Bishop::leftWhiteStartRow;
}
int Bishop::getleftWhiteStartColumn(){
return Bishop::leftWhiteStartColumn;
}
int Bishop::getrightWhiteStartRow(){
return Bishop::rightWhiteStartRow;
}
int Bishop::getrightWhiteStartColumn(){
return Bishop::rightWhiteStartColumn;
}
int Bishop::getleftBlackStartRow(){
return Bishop::leftBlackStartRow;
}
int Bishop::getleftBlackStartColumn(){
return Bishop::leftBlackStartColumn;
}
int Bishop::getrightBlackStartRow(){
return Bishop::rightBlackStartRow;
}
int Bishop::getrightBlackStartColumn(){
return Bishop::rightBlackStartColumn;
}
QString Bishop::getIconName(){
if(Bishop::getColor() == "white"){
return("bishop1");
} else {
return("bishop");
}
}
/*!
* \brief Bishop::checkPossibleMove Function return possible movex of object
* \param position Current position of object
* \param ChessBoard Current position of all object on chess board
* \return List boolean, which field is possible to move on
*/
array<array<bool,8>,8> Bishop::checkPossibleMove(array<int, 2> position, array<array<Pawn*,8>,8> ChessBoard){
array<array<bool,8>,8> possibleMoves;
string color = ChessBoard[position[0]][position[1]]->getColor();
string actualColor;
//prawy - przód
for(int row=0; row<8; row++){
for(int col=0; col<8; col++){
possibleMoves[row][col] = false;
}
}
if ((position[0]+1) < 8 && (position[1]+1) < 8){
int col = position[1]+1;
for(int i = (position[0] + 1); i<8; i++){
if(col < 8){
actualColor = ChessBoard[i][col]->getColor();
if(actualColor == ""){
possibleMoves[i][col] = true;
} else if (actualColor == color){
break;
} else {
possibleMoves[i][col] = true;
break;
}
}
col++;
}
}
//lewy tył
if ((position[0] - 1) >= 0 && (position[1] - 1) >= 0){
int col = position[1] - 1;
for(int i = (position[0] - 1); i>=0; i--){
if(col >= 0){
actualColor = ChessBoard[i][col]->getColor();
if(actualColor == ""){
possibleMoves[i][col] = true;
} else if (actualColor == color){
break;
} else {
possibleMoves[i][col] = true;
break;
}
}
col--;
}
}
//przód
if((position[0] + 1) < 8 && (position[1] - 1) >= 0) {
int col = position[1] - 1;
for(int i = (position[0] + 1); i<8; i++){
if(col >= 0){
actualColor = ChessBoard[i][col]->getColor();
if(actualColor == ""){
possibleMoves[i][col] = true;
} else if (actualColor == color){
break;
} else {
possibleMoves[i][col] = true;
break;
}
}
col--;
}
}
//tył
if((position[0] - 1) >= 0 && (position[1]+1) < 8){
int col = position[1] + 1;
for(int i = (position[0] - 1); i>=0; i--){
if(col < 8){
actualColor = ChessBoard[i][col]->getColor();
if(actualColor == ""){
possibleMoves[i][col] = true;
} else if (actualColor == color){
break;
} else {
possibleMoves[i][col] = true;
break;
}
}
col++;
}
}
possibleMoves[position[0]][position[1]] = false;
return possibleMoves;
}