-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bishop.java
108 lines (88 loc) · 2.64 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
/**************************************************************
* Functionality for each Bishop Piece
*
* @author Richard
* @author Steven
* @version 3/13/2022
**************************************************************/
public class Bishop extends ChessPiece {
/*************************************************************
* Default constructor call the ChessPiece constructor
*************************************************************/
public Bishop(Player player) {
super(player);
}
/*************************************************************
* Returns the type of chesspiece
*
* @return String
*************************************************************/
public String type() {
return "Bishop";
}
/*************************************************************
* Check to see if the selected position is diagonal from the
* bishop
*
* @param move
* @param board
* @return boolean
*************************************************************/
public boolean isDiagonalMove(Move move, ChessPiece[][] board) {
int columnMagnitude =
Math.abs(move.fromColumn - move.toColumn);
int rowMagnitude = Math.abs(move.fromRow - move.toRow);
if (columnMagnitude == rowMagnitude) {
return true;
}
return false;
}
/*************************************************************
* Checks to see if the bishop's path is clear
*
* @param move
* @param board
* @return boolean
*************************************************************/
public boolean isPieceInWay(Move move, ChessPiece[][] board) {
int columnMagnitude =
Math.abs(move.fromColumn - move.toColumn) - 1;
int i = 1;
while (i <= columnMagnitude
&& 0 < columnMagnitude) {
int column;
int row;
if (move.fromColumn - move.toColumn > 0) {
column = move.fromColumn - i;
} else {
column = move.fromColumn + i;
}
if (move.fromRow - move.toRow > 0) {
row = move.fromRow - i;
} else {
row = move.fromRow + i;
}
if (board[row][column] != null) {
return true;
}
i++;
}
return false;
}
/*************************************************************
* Verifies that the bishop can move to the selected postition
*
* @param move
* @param board
* @return boolean
*************************************************************/
public boolean isValidMove(Move move, ChessPiece[][] board) {
if (!super.isValidMove(move, board))
return false;
if (!isDiagonalMove(move, board))
return false;
if (isPieceInWay(move, board))
return false;
return true;
}
}