ElnuDev/Chess
Archived
1
0
Fork 0
Code Issues Projects Releases Packages Wiki Activity

Implement castling

Browse source
This commit is contained in:
Elnu 2023-03-15 22:41:49 -07:00
parent c9cf5fa8fb
commit 0a838ba7ee
4 changed files with 54 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
src/Board.java
View file

@ -128,7 +128,15 @@ public class Board {
public void move(Move move) {
if (move == null) return;
move(move.from, move.to);
// White pieces disappear if new move isn't created, don't know why
Move copiedMove = new Move(new BoardCoordinate(move.from.x, move.from.y), new BoardCoordinate(move.to.x, move.to.y), get(move.to.x, move.to.y));
copiedMove.submove = move.submove;
moveHistory.add(copiedMove);
// moveHistory.add(move);
set(move.to, get(move.from));
set(move.from, null);
move(move.submove);
if (move.submove != null) moveHistory.pop();
}
public void undoMove() {
@ -178,7 +186,7 @@ public class Board {
ArrayList<Move> legalMoves = piece.getLegalMoves(dragging, this);
for (Move legalMove : legalMoves) {
if (newCoordinate.equals(legalMove.to)) {
move(dragging, newCoordinate);
move(legalMove);
setLastMovedPieceAsMoved();
checkForCheckmate();
if (!isGameOver) {

2
src/ChessAI.java
View file

@ -1,5 +1,5 @@
public class ChessAI {
private static final int MAX_DEPTH = 4;
private static final int MAX_DEPTH = 3;
public static Move findBestMove(Board board) {
int bestScore = Integer.MIN_VALUE;

36
src/King.java
View file

@ -20,7 +20,41 @@ public class King extends Piece {
possibleMoves.add(new Move(position, new BoardCoordinate(position.x + 1, position.y)));
possibleMoves.add(new Move(position, new BoardCoordinate(position.x, position.y + 1)));
possibleMoves.add(new Move(position, new BoardCoordinate(position.x, position.y - 1)));
Piece rightRook = board.get(position.x + 3, position.y);
{
BoardCoordinate rightRookPosition = new BoardCoordinate(position.x + 3, position.y);
Piece rightRook = board.get(rightRookPosition);
if (!moved &&
rightRook instanceof Rook &&
!rightRook.moved &&
board.get(position.x + 1, position.y) == null &&
board.get(position.x + 2, position.y) == null &&
!isInCheck(board)
) {
// TODO: Does not take into account squares in castling path being threatened
Move rightCastle = new Move(position, new BoardCoordinate(position.x + 2, position.y));
rightCastle.submove = new Move(rightRookPosition, new BoardCoordinate(rightRookPosition.x - 2, rightRookPosition.y));
possibleMoves.add(rightCastle);
}
}
{
BoardCoordinate leftRookPosition = new BoardCoordinate(position.x - 4, position.y);
Piece leftRook = board.get(leftRookPosition);
if (!moved &&
leftRook instanceof Rook &&
!leftRook.moved &&
board.get(position.x - 1, position.y) == null &&
board.get(position.x - 2, position.y) == null &&
board.get(position.x - 3, position.y) == null &&
!isInCheck(board)
) {
// TODO: Does not take into account squares in castling path being threatened
Move leftCastle = new Move(position, new BoardCoordinate(position.x - 2, position.y));
leftCastle.submove = new Move(leftRookPosition, new BoardCoordinate(leftRookPosition.x + 3, leftRookPosition.y));
possibleMoves.add(leftCastle);
}
}
return possibleMoves;
}

11
src/Piece.java
View file

@ -50,12 +50,18 @@ public abstract class Piece {
}
boolean isInCheck(Move move, Board board) {
boolean isInCheck = false;
board.move(move);
boolean isInCheck = isInCheck(board);
if (move != null) board.undoMove();
return isInCheck;
}
boolean isInCheck(Board board) {
boolean isInCheck = false;
outer: for (int y = 0; y < Board.BOARD_SIZE; y++) {
for (int x = 0; x < Board.BOARD_SIZE; x++) {
Piece piece = board.get(x, y);
if (piece == null || piece.black == black) continue;
if (piece == null || piece.black == black || piece instanceof King) continue;
ArrayList<Move> legalMoves = piece.getLegalMoves(new BoardCoordinate(x, y), board, false);
for (Move legalMove : legalMoves) {
Piece pieceAtMove = board.get(legalMove.to);
@ -66,7 +72,6 @@ public abstract class Piece {
}
}
}
board.undoMove();
return isInCheck;
}