-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBishop.java
138 lines (127 loc) · 4.39 KB
/
Bishop.java
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
import javafx.scene.image.Image;
import javafx.scene.image.ImageView;
public class Bishop extends Piece{
boolean white;
ChessSlot space;
Image image;
ImageView imageView;
ChessSlot[][] array;
boolean isSelected;
boolean whiteTurn;
public Bishop(boolean isWhite, ChessSlot chess, ChessSlot[][] gridArray) {
if(isWhite) {
image = new Image("whitebishop.png");
} else {
image = new Image("blackbishop.png");
}
imageView = new ImageView(image);
imageView.setFitHeight(55);
imageView.setFitWidth(32);
space = chess;
white = isWhite;
array = gridArray;
whiteTurn = true;
}
public void changeTurn(){
whiteTurn = !whiteTurn;
}
public boolean getTurn(){
return whiteTurn;
}
public ImageView getImageView() {
return imageView;
}
public void update() {
if(isSelected) {
int horz = space.getHorz();
int vert = space.getVert();
space.highlight();
//Right Up
for(int h = 1; h < 8; h++) {
if((horz + h >= 0 && horz + h <= 7) && (vert - h >= 0 && vert - h <= 7)) {
if(array[vert - h][horz + h].hasPiece()) {
if((array[vert - h][horz + h].getPiece().isWhite() == !space.getPiece().isWhite())) {
array[vert - h][horz + h].select(space);
break;
} else {
break;
}
} else {
array[vert - h][horz + h].select(space);
}
}
}
//Right Down
for(int h = 1; h < 8; h++) {
if((horz + h >= 0 && horz + h <= 7) && (vert + h >= 0 && vert + h <= 7)) {
if(array[vert + h][horz + h].hasPiece()) {
if(array[vert + h][horz + h].getPiece().isWhite() == !space.getPiece().isWhite()) {
array[vert + h][horz + h].select(space);
break;
} else {
break;
}
} else {
array[vert + h][horz + h].select(space);
}
}
}
//Left Up
for(int v = 1; v < 8; v++) {
if((horz - v >= 0 && horz - v <= 7) && (vert - v >= 0 && vert - v <= 7)) {
if(array[vert - v][horz - v].hasPiece()) {
if(array[vert - v][horz - v].getPiece().isWhite() == !space.getPiece().isWhite()) {
array[vert - v][horz - v].select(space);
break;
} else {
break;
}
} else {
array[vert - v][horz - v].select(space);
}
}
}
//Left Down
for(int v = 1; v < 8; v++) {
if((horz - v >= 0 && horz - v <= 7) && (vert + v >= 0 && vert + v <= 7)) {
if(array[vert + v][horz - v].hasPiece()) {
if(array[vert + v][horz - v].getPiece().isWhite() == !space.getPiece().isWhite()) {
array[vert + v][horz - v].select(space);
break;
} else {
break;
}
} else {
array[vert + v][horz - v].select(space);
}
}
}
}
}
public void selected() {
for(ChessSlot[] row : array) {
for(ChessSlot slot : row) {
slot.removeHighlight();
slot.deSelect();
}
}
isSelected = true;
update();
}
public void deselect() {
isSelected = false;
update();
}
public void move(ChessSlot newSlot) {
space = newSlot;
for(ChessSlot[] row : array) {
for(ChessSlot s : row) {
s.removeHighlight();
s.deSelect();
}
}
}
public boolean isWhite() {
return white;
}
}