DeepestBlueOpenMP/Rook.java at master · TrainerRed151/DeepestBlueOpenMP · 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
//Brian Pomerantz

import java.util.*;

public class Rook extends Piece {
	public Rook(boolean si, byte r, byte f) {
		super(si, 'R', (byte) 5, r, f);
	}

	//Updates legal move list
	public void update(Board bd) {
		moves.clear();
		attack.clear();
		//defend.clear();

		Piece[][] b = bd.getBoard();
		//int pieceValue, a = 0, d = 0, m;
		byte r = getRank();
		byte c = getFile();

		for (byte i = 1; bd.isValid(r + i, c); i++) {
			if (b[r + i][c] instanceof Null) {
				moves.add(b[r + i][c]);
			}

			else if (b[r + i][c].getSide() != getSide()) {
				moves.add(b[r + i][c]);
				attack.add(b[r + i][c]);
				break;
			}

			else {
				//defend.add(b[r + i][c]);
				break;
			}
		}

		for (byte i = -1; bd.isValid(r + i, c); i--) {
			if (b[r + i][c] instanceof Null) {
				moves.add(b[r + i][c]);
			}

			else if (b[r + i][c].getSide() != getSide()) {
				moves.add(b[r + i][c]);
				attack.add(b[r + i][c]);
				break;
			}

			else {
				//defend.add(b[r + i][c]);
				break;
			}
		}

		for (byte i = 1; bd.isValid(r, c + i); i++) {
			if (b[r][c + i] instanceof Null) {
				moves.add(b[r][c + i]);
			}

			else if (b[r][c + i].getSide() != getSide()) {
				moves.add(b[r][c + i]);
				attack.add(b[r][c + i]);
				break;
			}

			else {
				//defend.add(b[r][c + i]);
				break;
			}
		}

		for (byte i = -1; bd.isValid(r, c + i); i--) {
			if (b[r][c + i] instanceof Null) {
				moves.add(b[r][c + i]);
			}

			else if (b[r][c + i].getSide() != getSide()) {
				moves.add(b[r][c + i]);
				attack.add(b[r][c + i]);
				break;
			}

			else {
				//defend.add(b[r][c + i]);
				break;
			}
		}

		//for (int i = 0; i < attack.size(); i++) {
		//	a += attack.get(i).getValue();
		//
		//	if (attack.get(i) instanceof King) {
		//		a += 10;
		//	}
		//}

		//for (int i = 0; i < defend.size(); i++) {
		//	d += defend.get(i).getValue();
		//}

		//m = moves.size();
		//pieceValue = (45/getValue()) * (getValue() + a + d + m);

		//pieceValue = getValue();

		//return pieceValue;
	}

	public ArrayList<Piece> getMoves() {
		return moves;
	}

	public ArrayList<Piece> getAttack() {
		return attack;
	}
//
//	public ArrayList<Piece> getDefend() {
//		return defend;
//	}
}