ChessGame/Bishop.java at master · Colt94/ChessGame · 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
package chessGame;
import javax.swing.ImageIcon;

public class Bishop extends Unit{

	Bishop(int _color){
		unitType = "B";
		value = 10;
		color = _color;
		captured = false;

		if (color == 0) {
			img = new ImageIcon("BW.png");
		}
		else if (color == 1) {
			img = new ImageIcon("BB.png");
		}
	}

	public void clearMoves() {
		possibleMoves.clear();
	}

	public void setUnits(Unit[][] units)
	{
		this.units = units;
	}

	public void setAvailableMoves(int currentX, int currentY, int moveNum)
	{
		//Down and Right
		for(int i = 1; i < currentX + 8; ++i)
		{
			if(!onBoard(new int[] {currentX + i, currentY + i}))
			{
				break;
			}
			if(units[currentY + i][currentX + i] != null && units[currentY + i][currentX + i].color == this.color)
			{
				break;
			}
			if(units[currentY + i][currentX + i] != null && units[currentY + i][currentX + i].color != this.color)
			{
				possibleMoves.add(new int[] {currentX + i, currentY + i});
				break;
			}
			possibleMoves.add(new int[] {currentX + i, currentY + i});
		}
		//Up and Right
		for(int i = 1; i < currentX + 8; ++i)
		{
			if(!onBoard(new int[] {currentX + i, currentY - i}))
			{
				break;
			}
			if(units[currentY - i][currentX + i] != null && units[currentY - i][currentX + i].color == this.color)
			{
				break;
			}
			if(units[currentY - i][currentX + i] != null && units[currentY - i][currentX + i].color != this.color)
			{
				possibleMoves.add(new int[] {currentX + i, currentY - i});
				break;
			}
			possibleMoves.add(new int[] {currentX + i, currentY - i});
		}
		//Down and Left
		for(int i = 1; i < currentX + 8; ++i)
		{
			if(!onBoard(new int[] {currentX - i, currentY + i}))
			{
				break;
			}
			if(units[currentY + i][currentX - i] != null && units[currentY + i][currentX - i].color == this.color)
			{
				break;
			}
			if(units[currentY + i][currentX - i] != null && units[currentY + i][currentX - i].color != this.color)
			{
				possibleMoves.add(new int[] {currentX - i, currentY + i});
				break;
			}
			possibleMoves.add(new int[] {currentX - i, currentY + i});
		}
		//Up and Left
		for(int i = 1; i < currentX + 8; ++i)
		{
			if(!onBoard(new int[] {currentX - i, currentY - i}))
			{
				break;
			}
			if(units[currentY - i][currentX - i] != null && units[currentY - i][currentX - i].color == this.color)
			{
				break;
			}
			if(units[currentY - i][currentX - i] != null && units[currentY - i][currentX - i].color != this.color)
			{
				possibleMoves.add(new int[] {currentX - i, currentY - i});
				break;
			}
			possibleMoves.add(new int[] {currentX - i, currentY - i});
		}
		removeFriendlyMoves();
	}

	public boolean checkMove(int desiredX, int desiredY)
	{
		int[] possibleMove = new int[2];
		int possibleX = 0;
		int possibleY = 0;
		for(int i = 0; i < possibleMoves.size(); i++)
		{
			possibleMove = possibleMoves.get(i);
			possibleX = possibleMove[0];
			possibleY = possibleMove[1];
			if ((desiredX == possibleX) && (desiredY == possibleY))
			{
				possibleMoves.clear();
				return true;
			}
		}
		possibleMoves.clear();
		return false;
	}
}