Chess/Bishop.java at master · Ramenable/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
package Chess;

import java.util.Set;

public class Bishop extends Piece{

    Bishop (boolean bl, Tile t) {
        super (bl, t);
    }
    @Override
    public Set<Tile> combinations() {
        Set<Tile> set = (Set<Tile>) new HashSet<>();
        int xloc = this.location.x;
        int yloc = this.location.y;
        int count = 0;

        xloc = this.location.x;
        yloc = this.location.y;
        while (blah) {
            set.add(board.get(xloc, yloc));
            xloc ++;
            yloc ++;
        }
        xloc = this.location.x;
        yloc = this.location.y;
        while (blah) {
            set.add(board.get(xloc, yloc));
            xloc --;
            yloc ++;
        }
        xloc = this.location.x;
        yloc = this.location.y;
        while (blah) {
            set.add(board.get(xloc, yloc));
            xloc ++;
            yloc --;
        }
        xloc = this.location.x;
        yloc = this.location.y;
        while (blah) {
            set.add(board.get(xloc, yloc));
            xloc --;
            yloc --;
        }

        return set;
    }

    @Override
    public void move(Tile moveToTile) {
        this.location.x = moveToTile.x;
        this.location.y = moveToTile.y;
    }
}