Chess-Engine-Java/Rook.java at master · aprasad36/Chess-Engine-Java · 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
public class Rook implements Piece {

    public boolean color;
    public boolean hasMoved;
    public int x, y;

    public Rook(boolean color, Square s) {
        this.color = color;
        this.x = s.x - 1;
        this.y = s.y - 1;
        s.occupy(this);
    }

    public String toString() {
        if (color) {
            return "Rw";
        } else {
            return "Rb";
        }
    }

    public boolean getColor() {
        return color;
    }


    // This doesn't work
    public int move(Board b, Square s) {
        if (s.squareInArray(this.influence(b))) {
            return 0;
        }
        return 1;
    }

    // Returns the influence of the rook. This doesn't always give legal moves because the rook might be pinned to the king.
    public Square[] influence(Board b) {
        Square[] returnSquares = new Square[14];
        boolean up = true;
        boolean down = true;
        boolean right = true;
        boolean left = true;
        int count = 0;
        for (int i = 1; i < 8; i++) {
            if (y + i < 8 && right) {
                if (!b.boardList[x][y+i].isOccupied) {
                    returnSquares[count] = b.boardList[x][y+i];
                    count++;
                } else {
                    if (color != b.boardList[x][y+i].occupiedBy.getColor()) {
                        returnSquares[count] = b.boardList[x][y+i];
                        count++;
                    }
                    right = false;
                }
            }
            if (y - i >= 0 && left) {
                if (!b.boardList[x][y-i].isOccupied) {
                    returnSquares[count] = b.boardList[x][y-i];
                    count++;
                } else {
                    if (color != b.boardList[x][y-i].occupiedBy.getColor()) {
                        returnSquares[count] = b.boardList[x][y-i];
                        count++;
                    }
                    left = false;
                }
            }
            if (x - i >= 0 && up) {
                if (!b.boardList[x-i][y].isOccupied) {
                    returnSquares[count] = b.boardList[x-i][y];
                    count++;
                } else {
                    if (color != b.boardList[x-i][y].occupiedBy.getColor()) {
                        returnSquares[count] = b.boardList[x-i][y];
                        count++;
                    }
                    up = false;
                }
            }
            if (x + i < 8 && down) {
                if (!b.boardList[x+i][y].isOccupied) {
                    returnSquares[count] = b.boardList[x+i][y];
                    count++;
                } else {
                    if (color != b.boardList[x+i][y].occupiedBy.getColor()) {
                        returnSquares[count] = b.boardList[x+i][y];
                        count++;
                    }
                    down = false;
                }
            }
        }
        return returnSquares;
    }

    public Square[] getLegalMoves(Board b) {
        return null;
    }

}