-
Notifications
You must be signed in to change notification settings - Fork 0
/
Rook.java
129 lines (108 loc) · 3.53 KB
/
Rook.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
/**************************************************************
* Functionality for each Rook Piece
*
* @author Richard
* @author Steven
* @version 3/13/2022
**************************************************************/
public class Rook extends ChessPiece {
/*************************************************************
* Default constructor calls ChessPiece constructor
*************************************************************/
public Rook(Player player) {
super(player);
}
/*************************************************************
* Returns the type of chesspiece
*************************************************************/
public String type() {
return "Rook";
}
/*************************************************************
* Confirms that the horizontal path is clear
*************************************************************/
private boolean isHorizontalPathClear(Move move, ChessPiece[][] board) {
int spacesToCheck =
Math.abs(move.toColumn - move.fromColumn) - 1;
int i = 1;
while (spacesToCheck >= i
&& spacesToCheck > 0) {
if (move.fromColumn > move.toColumn
&& move.toRow == move.fromRow) {
if (board[move.toRow][move.toColumn + i] != null) {
return false;
}
} else if (move.fromColumn < move.toColumn
&& move.toRow == move.fromRow) {
if (board[move.fromRow][move.fromColumn + i] != null) {
return false;
}
}
i++;
}
if (spacesToCheck >= 0) {
return true;
}
return false;
}
/*************************************************************
* Confirms that the vertical path is clear
*************************************************************/
private boolean isVerticalPathClear(Move move, ChessPiece[][] board) {
int spacesToCheck = Math.abs(move.toRow - move.fromRow) - 1;
int i = 1;
while (spacesToCheck >= i
&& spacesToCheck > 0) {
if (move.fromRow > move.toRow
&& move.toColumn == move.fromColumn) {
if (board[move.toRow + i][move.toColumn] != null) {
return false;
}
} else if (move.fromRow < move.toRow
&& move.toColumn == move.fromColumn) {
if (board[move.fromRow + i][move.toColumn] != null) {
return false;
}
}
i++;
}
if (spacesToCheck >= 0) {
return true;
}
return false;
}
/*************************************************************
* Verifies that the path is clear
*************************************************************/
private boolean isPathClear(Move move, ChessPiece[][] board) {
if (isHorizontalPathClear(move, board) ||
isVerticalPathClear(move, board)) {
return true;
}
return false;
}
/*************************************************************
* Verifies that the selected position is in a straight line
* from the rook
*************************************************************/
private boolean isStraightLine(Move move) {
if (Math.abs(move.fromColumn - move.toColumn) == 0
|| Math.abs(move.fromRow - move.toRow) == 0) {
return true;
}
return false;
}
/*************************************************************
* Determines if the move is valid for the rook
*************************************************************/
public boolean isValidMove(Move move, ChessPiece[][] board) {
boolean validity = super.isValidMove(move, board);
if (!isStraightLine(move)) {
return false;
}
if (!isPathClear(move, board)) {
return false;
}
return validity;
}
}