Crabs/3DChess
2
1
Fork 0
Code Issues 3 Pull Requests Actions Packages Projects Releases 2 Wiki Activity

lots of things

Browse Source
This commit is contained in:
Simon Pribylski
2025-04-01 23:11:41 +02:00
parent 2c6b64fa7d
commit 1b9ff5bdd1
15 changed files with 428 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

112
app/src/main/java/chess/model/ChessBoard.java
View File

@@ -1,11 +1,7 @@
package chess.model;
import chess.model.pieces.Bishop;
import chess.model.pieces.King;
import chess.model.pieces.Knight;
import chess.model.pieces.Pawn;
import chess.model.pieces.Queen;
import chess.model.pieces.Rook;
import java.util.Stack;
import chess.model.visitor.KingIdentifier;
import chess.model.visitor.PiecePathChecker;
@@ -28,6 +24,8 @@ public class ChessBoard {
}
private final Cell[][] cells;
private final Stack<Move> moves;
private final Stack<Piece> ejectedPieces;
public ChessBoard() {
this.cells = new Cell[Coordinate.VALUE_MAX][Coordinate.VALUE_MAX];
@@ -36,23 +34,43 @@ public class ChessBoard {
this.cells[i][j] = new Cell();
}
}
initPieces();
this.moves = new Stack<>();
this.ejectedPieces = new Stack<>();
}
public void applyMove(Move move) {
assert (move.isValid());
Piece deadPiece = pieceAt(move.getFinish());
if (deadPiece != null) {
deadPiece.eject();
deadPiece.eject(this.moves.size());
this.ejectedPieces.add(deadPiece);
}
Piece movingPiece = pieceAt(move.getStart());
pieceComes(movingPiece, move.getFinish());
pieceLeaves(move.getStart());
movingPiece.move();
this.moves.add(move);
}
public void undoMove(Move move) {
// for later
public void undoLastMove() {
assert !this.moves.empty() : "Can't undo at the beginning!";
Move move = this.moves.pop();
Piece movingPiece = pieceAt(move.getFinish());
pieceComes(movingPiece, move.getStart());
pieceLeaves(move.getFinish());
movingPiece.unMove();
if (this.ejectedPieces.empty())
return;
Piece piece = this.ejectedPieces.lastElement();
if (piece.getEjectedMoveNumber() != this.moves.size())
return;
pieceComes(piece, move.getFinish());
piece.eject(-1);
}
public boolean isCellEmpty(Coordinate coordinate) {
@@ -77,11 +95,11 @@ public class ChessBoard {
return this.cells[coordinate.getX()][coordinate.getY()];
}
private void pieceComes(Piece piece, Coordinate coordinate) {
public void pieceComes(Piece piece, Coordinate coordinate) {
cellAt(coordinate).setPiece(piece);
}
private void pieceLeaves(Coordinate coordinate) {
public void pieceLeaves(Coordinate coordinate) {
cellAt(coordinate).setPiece(null);
}
@@ -119,49 +137,55 @@ public class ChessBoard {
return false;
}
public boolean hasAllowedMoves(Color player) {
for (int i = 0; i < Coordinate.VALUE_MAX; i++) {
for (int j = 0; j < Coordinate.VALUE_MAX; j++) {
Coordinate attackCoords = new Coordinate(i, j);
Piece attackPiece = pieceAt(attackCoords);
if (attackPiece == null)
continue;
if (attackPiece.getColor() != player)
continue;
if (getAllowedMoves(attackCoords) != null)
return true;
}
}
return false;
}
public boolean[][] getAllowedMoves(Coordinate pieceCoords) {
Piece piece = pieceAt(pieceCoords);
if (piece == null)
return null;
boolean[][] result = new boolean[Coordinate.VALUE_MAX][Coordinate.VALUE_MAX];
Color player = piece.getColor();
boolean[][] result = new boolean[Coordinate.VALUE_MAX][Coordinate.VALUE_MAX];
for (int i = 0; i < Coordinate.VALUE_MAX; i++) {
for (int j = 0; j < Coordinate.VALUE_MAX; j++) {
PiecePathChecker piecePathChecker = new PiecePathChecker(this, new Move(pieceCoords, new Coordinate(i, j)));
result[i][j] = piecePathChecker.isValid();
Move move = new Move(pieceCoords, new Coordinate(i, j));
PiecePathChecker piecePathChecker = new PiecePathChecker(this,
move);
if (!piecePathChecker.isValid())
continue;
applyMove(move);
result[i][j] = !isKingInCheck(player);
undoLastMove();
}
}
return result;
}
public void initPieces() {
for (int i = 0; i < 8; i++) {
pieceComes(new Pawn(Color.Black), new Coordinate(i, 0));
pieceComes(new Pawn(Color.White), new Coordinate(i, Coordinate.VALUE_MAX - 1));
// return null is no valid moves are possible
for (int x = 0; x < 8; x++) {
for (int y = 0; y < 8; y++) {
if (result[x][y])
return result;
}
}
pieceComes(new Rook(Color.Black), new Coordinate(0, 1));
pieceComes(new Rook(Color.Black), new Coordinate(Coordinate.VALUE_MAX - 1, 1));
pieceComes(new Rook(Color.White), new Coordinate(0, Coordinate.VALUE_MAX - 2));
pieceComes(new Rook(Color.White), new Coordinate(Coordinate.VALUE_MAX - 1, Coordinate.VALUE_MAX - 2));
pieceComes(new Knight(Color.Black), new Coordinate(1, 1));
pieceComes(new Knight(Color.Black), new Coordinate(Coordinate.VALUE_MAX - 2, 1));
pieceComes(new Knight(Color.White), new Coordinate(1, Coordinate.VALUE_MAX - 2));
pieceComes(new Knight(Color.White), new Coordinate(Coordinate.VALUE_MAX - 2, Coordinate.VALUE_MAX - 2));
pieceComes(new Bishop(Color.Black), new Coordinate(2, 1));
pieceComes(new Bishop(Color.Black), new Coordinate(Coordinate.VALUE_MAX - 3, 1));
pieceComes(new Bishop(Color.White), new Coordinate(2, Coordinate.VALUE_MAX - 2));
pieceComes(new Bishop(Color.White), new Coordinate(Coordinate.VALUE_MAX - 3, Coordinate.VALUE_MAX - 2));
pieceComes(new Queen(Color.Black), new Coordinate(4, 1));
pieceComes(new King(Color.Black), new Coordinate(3, 1));
pieceComes(new Queen(Color.White), new Coordinate(4, Coordinate.VALUE_MAX - 2));
pieceComes(new King(Color.White), new Coordinate(3, Coordinate.VALUE_MAX - 2));
return null;
}
}