-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bishop.cpp
162 lines (141 loc) · 3.93 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
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
//
// Bishop.cpp
// Chess
//
// Created by Albaraa on 3/6/14.
// Copyright (c) 2014 Albaraa. All rights reserved.
//
#include "Bishop.h"
Bishop* Bishop::clone(){
return new Bishop (*this);
}
void Bishop::getValidMove(Piece* (&chessBoard)[9][9], std::vector<PieceMove> &allPossibleMoves, PieceMove & lastMove){
PieceMove newMove;
newMove.movingPiece = this;
//Checks all 4 diagonal line moves for Bishop.
//Used to get out of loops when necessary
int breakFlag = 0;
//Rank counter used to determine if current check is on diagonal line with the Queen piece.
int rankCounter = 0;
//File counter used to determine if current check is on diagonal line with the Queen piece.
int fileCounter;
for(int i = this->rank() + 1; i <= 8; i++){
fileCounter = 0;
for(int j = this->file() + 1; j <= 8; j++){
if(rankCounter == fileCounter){
if(chessBoard[i][j] != NULL && chessBoard[i][j]->owner() == this->owner()){
breakFlag = 1;
break;
}
newMove.fromRank = this->rank();
newMove.fromFile = this->file();
newMove.rank = i;
newMove.file = j;
newMove.promotion = 0;
if(isKingInCheck(chessBoard, newMove, *this) == false){
allPossibleMoves.push_back(newMove);
}
if(chessBoard[i][j] != NULL){
breakFlag = 1;
break;
}
}
fileCounter++;
}
if(breakFlag == 1){
break;
}
rankCounter++;
}
breakFlag = 0;
rankCounter = 0;
for(int i = this->rank() - 1; i > 0; i--){
fileCounter = 0;
for(int j = this->file() + 1; j <= 8; j++){
if(rankCounter == fileCounter){
if(chessBoard[i][j] != NULL && chessBoard[i][j]->owner() == this->owner()){
breakFlag = 1;
break;
}
newMove.fromRank = this->rank();
newMove.fromFile = this->file();
newMove.rank = i;
newMove.file = j;
newMove.promotion = 0;
if(isKingInCheck(chessBoard, newMove, *this) == false){
allPossibleMoves.push_back(newMove);
}
if(chessBoard[i][j] != NULL){
breakFlag = 1;
break;
}
}
fileCounter++;
}
if(breakFlag == 1){
break;
}
rankCounter++;
}
breakFlag = 0;
rankCounter = 0;
for(int i = this->rank() + 1; i <= 8; i++){
fileCounter = 0;
for(int j = this->file() - 1; j > 0; j--){
if(rankCounter == fileCounter){
if(chessBoard[i][j] != NULL && chessBoard[i][j]->owner() == this->owner()){
breakFlag = 1;
break;
}
newMove.fromRank = this->rank();
newMove.fromFile = this->file();
newMove.rank = i;
newMove.file = j;
newMove.promotion = 0;
if(isKingInCheck(chessBoard, newMove, *this) == false){
allPossibleMoves.push_back(newMove);
}
if(chessBoard[i][j] != NULL){
breakFlag = 1;
break;
}
}
fileCounter++;
}
if(breakFlag == 1){
break;
}
rankCounter++;
}
breakFlag = 0;
rankCounter = 0;
for(int i = this->rank() - 1; i > 0; i--){
fileCounter = 0;
for(int j = this->file() - 1; j > 0; j--){
if(rankCounter == fileCounter){
if(chessBoard[i][j] != NULL && chessBoard[i][j]->owner() == this->owner()){
breakFlag = 1;
break;
}
newMove.fromRank = this->rank();
newMove.fromFile = this->file();
newMove.rank = i;
newMove.file = j;
newMove.promotion = 0;
if(isKingInCheck(chessBoard, newMove, *this) == false){
allPossibleMoves.push_back(newMove);
}
if(chessBoard[i][j] != NULL){
breakFlag = 1;
break;
}
}
fileCounter++;
}
if(breakFlag == 1){
break;
}
rankCounter++;
}
return;
};