CT/chess
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

king, copy board logic, getPseudoMoves

Browse Source
This commit is contained in:
CT
2026-04-24 13:34:00 -05:00
parent 984c37a833
commit c3318f834c
16 changed files with 185 additions and 120 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
Rook.java
View File

@@ -9,64 +9,23 @@ public class Rook extends Piece {
hasMoved = false;
}
public ArrayList<Position> getLegalMoves(Board board) {
public Piece copy() {
Piece newP = new Rook(this.pos.x, this.pos.y, this.color);
return newP;
}
public ArrayList<Position> getPseudoLegalMoves(Board board) {
ArrayList<Position> positions = new ArrayList<Position>();
// check left
for (int i = pos.x - 1; i >= 0; i--) {
Position test = new Position(i, pos.y);
if (board.isOpen(test)) {
positions.add(test);
continue;
} else if (board.getPiece(test).colorMatches(this)) {
break;
} else {
positions.add(test);
break;
}
}
positions.addAll(slide(board, 1, 0));
positions.addAll(slide(board, -1, 0));
positions.addAll(slide(board, 0, 1));
positions.addAll(slide(board, 0, -1));
// check right
for (int i = pos.x + 1; i <= 7; i++) {
Position test = new Position(i, pos.y);
if (board.isOpen(test)) {
positions.add(test);
continue;
} else if (board.getPiece(test).colorMatches(this)) {
break;
} else {
positions.add(test);
break;
}
}
// check up
for (int i = pos.y + 1; i <= 7; i++) {
Position test = new Position(pos.x, i);
if (board.isOpen(test)) {
positions.add(test);
continue;
} else if (board.getPiece(test).colorMatches(this)) {
break;
} else {
positions.add(test);
break;
}
}
// check down
for (int i = pos.y - 1; i >= 0; i--) {
Position test = new Position(pos.x, i);
if (board.isOpen(test)) {
positions.add(test);
continue;
} else if (board.getPiece(test).colorMatches(this)) {
break;
} else {
positions.add(test);
break;
}
}
return positions;
}
public ArrayList<Position> getLegalMoves(Board board) {
return null;
}
}