ChessEngine/Bishop.java at master · gmihalea/ChessEngine · GitHub

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
import java.util.ArrayList;

public class Bishop extends Piece {

	public Bishop(Square position, int color) {
		super(position, color);
	}

	@Override
	public ArrayList<Square> getValidSquares() {
		int row = this.getPosition().getNumber();
		int column = this.getPosition().getLetter();
		int oponentColor = (this.getColor() == PieceColor.WHITE) ? PieceColor.BLACK : PieceColor.WHITE;
		Square intermediate;
		ArrayList<Square> result = new ArrayList<Square>();

		/*
		 * Checks availability diagonally left-down
		 */

		for(int i=column, j=row; i>Letter.A && j>1; i--, j--) {
			intermediate = Board.translate(i-1, j-1);
			if(intermediate.getPiece() == null) {
				result.add(intermediate);
			} else if (intermediate.getPiece().getColor() == oponentColor){
				result.add(intermediate);
				break;
			} else
				break;
		}

		/*
		 * Checks availability diagonally left-up;
		 */

		for(int i=column, j=row; i>Letter.A && j<8; i--, j++) {
			intermediate = Board.translate(i-1, j+1);
			if(intermediate.getPiece() == null) {
				result.add(intermediate);
			} else if (intermediate.getPiece().getColor() == oponentColor){
				result.add(intermediate);
				break;
			} else
				break;
		}

		/*
		 * Checks availability diagonally right-up;
		 */

		for(int i=column, j=row; i<Letter.H && j<8; i++, j++) {
			intermediate = Board.translate(i+1, j+1);
			if(intermediate.getPiece() == null) {
				result.add(intermediate);
			} else if (intermediate.getPiece().getColor() == oponentColor){
				result.add(intermediate);
				break;
			} else
				break;
		}

		/*
		 * Checks availability diagonally right-down;
		 */

		for(int i=column, j=row; i<Letter.H && j>1; i++, j--) {
			intermediate = Board.translate(i+1, j-1);
			if(intermediate.getPiece() == null) {
				result.add(intermediate);
			} else if (intermediate.getPiece().getColor() == oponentColor){
				result.add(intermediate);
				break;
			} else
				break;
		}

		return result;
	}

}