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

public class Queen extends Piece {

	public Queen(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 upwards
		 */

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

		/*
		 * Checks availability downwards
		 */

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

		/*
		 * Checks availability sideways to left
		 */

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

		/*
		 * Checks availability sideways to right
		 */

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

		/*
		 * 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;
	}

}