-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueen.java
144 lines (134 loc) · 3.43 KB
/
Queen.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
139
140
141
142
143
144
import java.awt.Graphics;
import java.util.ArrayList;
public class Queen extends Piece {
public int value;
public Queen(int turn, int xloc, int yloc, String piece_name, int score) {
super(turn,xloc,yloc,piece_name, score);
}
public int get_value(int turn) {
if(turn == 1) {
value = -50;
}
else if(turn == 0) {
value = 50;
}
return value;
}
@Override
public ArrayList<int[]> get_moves(Piece[][] board) {
ArrayList<int[]> moves = new ArrayList<int[]>();
for (int dist = 1; dist < 8; dist ++) {
if (x + dist > 7 )
break;
if (board[x + dist][y].get_team() == team)
break;
int[] move = {x + dist,y};
moves.add(move);
if (board[x + dist][y].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if (x - dist < 0 )
break;
if (board[x - dist][y].get_team() == team)
break;
int[] move = {x - dist, y};
moves.add(move);
if (board[x - dist][y].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if ( y - dist < 0)
break;
if (board[x ][y - dist].get_team() == team)
break;
int[] move = {x, y - dist};
moves.add(move);
if (board[x][y - dist].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if ( y + dist > 7)
break;
if (board[x][y + dist].get_team() == team)
break;
int[] move = {x , y + dist};
moves.add(move);
if (board[x][y + dist].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if (x + dist > 7 || y + dist > 7)
break;
if (board[x + dist][y + dist].get_team() == team)
break;
int[] move = {x + dist, y + dist};
moves.add(move);
if (board[x + dist][y + dist].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if (x - dist < 0 || y + dist > 7)
break;
if (board[x - dist][y + dist].get_team() == team)
break;
int[] move = {x - dist, y + dist};
moves.add(move);
if (board[x - dist][y + dist].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if (x - dist < 0 || y - dist < 0)
break;
if (board[x - dist][y - dist].get_team() == team)
break;
int[] move = {x - dist, y - dist};
moves.add(move);
if (board[x - dist][y - dist].get_team() == (team+1)%2)
break;
}
for (int dist = 1; dist < 8; dist ++) {
if (x + dist > 7 || y - dist < 0)
break;
if (board[x + dist][y - dist].get_team() == team)
break;
int[] move = {x + dist, y - dist};
moves.add(move);
if (board[x + dist][y - dist].get_team() == (team+1)%2)
break;
}
return moves;
}
@Override
public boolean check(King king, Piece[][] board) {
int x_dist = king.get_loc()[0] - x;
int y_dist = king.get_loc()[1] - y;
if (Math.abs(x_dist) == Math.abs(y_dist)) {
int x_dir = x_dist/Math.abs(x_dist);
int y_dir = y_dist/Math.abs(y_dist);
for (int i = 1; i < x_dist; i ++)
for (int j = 1; j < y_dist; j++) {
if (board[x + x_dir*i][y + y_dir*j].get_team() != -1)
return false;
}
return true;
}
if (y_dist == 0) {
int x_dir = x_dist/Math.abs(x_dist);
for (int i = 1; i < x_dist; i ++) {
if (board[x + i*x_dir][y].get_team() != -1)
return false;
}
return true;
}
if (x_dist == 0) {
int y_dir = y_dist/Math.abs(y_dist);
for (int i = 1; i < y_dist; i ++) {
if (board[x][y + i*y_dir].get_team() != -1)
return false;
}
return true;
}
return false;
}
}