Bishop.java

import java.util.HashSet;

import javax.swing.ImageIcon;


@SuppressWarnings("serial")
public class Bishop extends Piece {
		
	public Bishop(Shade clr, int[] startCoords, Chessboard cb){
		super(clr, startCoords, cb,"Bishop");
		if (clr == Shade.WHITE){
			try{
				setIcon(new ImageIcon("Images/whiteBishop.png"));
				setText("");
			} catch (Exception e){
				//Keep label as-is if image not found
			}
		} else {
			try{
				setIcon(new ImageIcon("Images/blackBishop.png"));
				setText("");
			} catch (Exception e){
				//Keep label as-is if image not found
			}
		}
	}
	
	public boolean validMove(Coord cd){
		if (cd == null || !(c.getSquare(cd).canMove(this.color))) return false;
		if (coords.vectorTo(cd).equals(new Coord(0,0))) return false;
		if (coords.vectorTo(cd).getFile() == coords.vectorTo(cd).getRank()){
			int maxRank = Math.max(coords.getRank(), cd.getRank());
			int minRank = Math.min(coords.getRank(), cd.getRank());
			int minFile = Math.min(coords.getFile(), cd.getFile());
			for(int x = 1; x < maxRank - minRank; x++)
				if (c.getSquare(new Coord((minFile + x),(minRank + x))).isOccupied()) return false;
			return true;
		} else if (coords.vectorTo(cd).getFile() == (coords.vectorTo(cd).getRank() * -1)){
			int maxFile = Math.max(coords.getFile(), cd.getFile());
			int minFile = Math.min(coords.getFile(), cd.getFile());
			int maxRank = Math.max(coords.getRank(), cd.getRank());
			for(int x = 1; x < maxFile - minFile; x++)
				if (c.getSquare(new Coord((minFile + x),(maxRank - x))).isOccupied()) return false;
			return true;
		} else return false;
	}
	
	public HashSet<Coord> getAttack(){
		attack.clear();
		if (!(this.alive)) return attack;	
		for (int i = 1; i < 7; i++){
			if (!(inRange(this.coords.add(new Coord(i,i))))){
				break;
			} else {
				if (c.getSquare(this.coords.add(new Coord(i,i))).isOccupied()) {
					attack.add(this.coords.add(new Coord(i,i)));
					break;
				} else {
					attack.add(this.coords.add(new Coord(i,i)));
				}
			}
		}
		
		for (int i = 1; i < 7; i++){
			if (!(inRange(this.coords.add(new Coord(-i,i))))){
				break;
			} else {
				if (c.getSquare(this.coords.add(new Coord(-i,i))).isOccupied()) {
					attack.add(this.coords.add(new Coord(-i,i)));
					break;
				} else {
					attack.add(this.coords.add(new Coord(-i,i)));
				}
			}
		}
		
		for (int i = 1; i < 7; i++){
			if (!(inRange(this.coords.add(new Coord(i,-i))))){
				break;
			} else {
				if (c.getSquare(this.coords.add(new Coord(i,-i))).isOccupied()) {
					attack.add(this.coords.add(new Coord(i,-i)));
					break;
				} else {
					attack.add(this.coords.add(new Coord(i,-i)));
				}
			}
		}
		
		for (int i = 1; i < 7; i++){
			if (!(inRange(this.coords.add(new Coord(-i,-i))))){
				break;
			} else {
				if (c.getSquare(this.coords.add(new Coord(-i,-i))).isOccupied()) {
					attack.add(this.coords.add(new Coord(-i,-i)));
					break;
				} else {
					attack.add(this.coords.add(new Coord(-i,-i)));
				}
			}
		}
		
		return attack;
	}
	
	public String toString(){
		return (this.color + " Bishop at " + c.getSquare(coords).toString());
	}

}