chess/bishop.java at master · c-brooks/chess · 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

public class Bishop {

	static boolean[] bMovesW = new boolean[64];
	static boolean[] bMovesB = new boolean[64];

	public static String movesW(int i) {
		String move = "";
		String newMove = "";
		String oldPiece = "";
		int r = i / 8, c = i % 8;
		int moveCount = 1;

		for (int j = 1; j >= -1; j--) {
			for (int k = 1; k >= -1; k--) {
				if (j != 0 & k != 0) {
					try {
						while (" ".equals(Board.chessBoard[r + j * moveCount][c + k * moveCount])) {
							newMove = "" + r + c + (r + j * moveCount) + (c + k * moveCount) + " ";
							bMovesW[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;

							if (!Board.whoseMove) // White to move
							{
								Board.makeMove(newMove);
								if (King.kingSafeW())
									move = move + newMove;
								Board.undoMove(newMove);
								moveCount++;
							}
						}
						bMovesW[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;
						if (Character
								.isLowerCase(Board.chessBoard[r + j * moveCount][c + k * moveCount].charAt(0))) {
							oldPiece = Board.chessBoard[r + j * moveCount][c + k * moveCount];
							newMove = "" + r + c + (r + j * moveCount) + (c + k * moveCount) + oldPiece;
							if (!Board.whoseMove) {
								Board.makeMove(newMove);
								if (King.kingSafeW())
									move = move + newMove;
								Board.undoMove(newMove);
							}
						}
					} catch (Exception e) {
					}
					moveCount = 1;
				}
			}
		}
//		BB.bMovesW = bMovesW;
		return move;
	}

	public static String movesB(int i) {
		String move = "";
		String newMove = "";
		String oldPiece = "";
		int r = i / 8, c = i % 8;
		int moveCount = 1;

		for (int j = 1; j >= -1; j--) {
			for (int k = 1; k >= -1; k--) {
				if (j != 0 & k != 0) {
					try {
						while (" ".equals(Board.chessBoard[r + j * moveCount][c + k * moveCount]))
						{
							newMove = "" + r + c + (r + j * moveCount) + (c + k * moveCount) + " ";
							bMovesB[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;

								Board.makeMove(newMove);
								if (King.kingSafeB())
									move = move + newMove;
								Board.undoMove(newMove);
								moveCount++;
						}
						bMovesB[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;
						if (Character
								.isUpperCase(Board.chessBoard[r + j * moveCount][c + k * moveCount].charAt(0))) {
							oldPiece = Board.chessBoard[r + j * moveCount][c + k * moveCount];
							newMove = "" + r + c + (r + j * moveCount) + (c + k * moveCount) + oldPiece;

							if (Board.whoseMove) {
								Board.makeMove(newMove);
								if (King.kingSafeB())
									move = move + newMove;
								Board.undoMove(newMove);
								}
							}
						} catch (Exception e) {
					}
					moveCount = 1;
				}
			}
		}
		return move;
	}

	public static void controlW(int i) {
		int r = i / 8, c = i % 8;
		int moveCount = 1;

		for (int j = 1; j >= -1; j--) {
			for (int k = 1; k >= -1; k--) {
				if (j != 0 & k != 0) {
					try {
						while (" ".equals(Board.chessBoard[r + j * moveCount][c + k * moveCount])) {
							BB.bMovesW[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;
							moveCount++;
						}
						BB.bMovesW[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;
					} catch (Exception e) {}
					moveCount = 1;
				}
			}
		}
	}

	public static void controlB(int i) {
		int r = i / 8, c = i % 8;
		int moveCount = 1;

		for (int j = 1; j >= -1; j--) {
			for (int k = 1; k >= -1; k--) {
				if (j != 0 & k != 0) {
					try {
						while (" ".equals(Board.chessBoard[r + j * moveCount][c + k * moveCount])) {
							BB.bMovesB[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;
							moveCount++;
						}
						BB.bMovesB[(r + j * moveCount) * 8 + (c + k * moveCount)] = true;
					} catch (Exception e) {}
					moveCount = 1;
				}
			}
		}
	}
}