antoine.bahmed
/
OOP_1B3_Project
2
1
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

les pieces bougent !!!!!

This commit is contained in:
MSI-AB\antoineB 2025-04-20 19:15:59 +02:00
parent 04e8856ab0
commit 9e15058fb8
1 changed files with 92 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

92
src/backend/Board.java
View File

@ -432,6 +432,98 @@ private ArrayList<int[]> computeLegalMoves(Piece piece) {
if (isEnemy(x + 1, nextY, piece.isWhite())) { if (isEnemy(x + 1, nextY, piece.isWhite())) {
moves.add(new int[]{x + 1, nextY}); moves.add(new int[]{x + 1, nextY});
} }
}
if (type == PieceType.Rook) {
// Directions : haut, bas, gauche, droite
int[][] directions = {{1,0},{-1,0},{0,1},{0,-1}};
for (int[] dir : directions) {
int nx = x + dir[0];
int ny = y + dir[1];
while (nx >= 0 && nx < width && ny >= 0 && ny < height) {
if (isEmpty(nx, ny)) {
moves.add(new int[]{nx, ny});
} else {
if (isEnemy(nx, ny, piece.isWhite())) {
moves.add(new int[]{nx, ny});
}
break;
}
nx += dir[0];
ny += dir[1];
}
}
}
if (type == PieceType.Bishop) {
// Directions : diagonales
int[][] directions = {{1,1},{1,-1},{-1,1},{-1,-1}};
for (int[] dir : directions) {
int nx = x + dir[0];
int ny = y + dir[1];
while (nx >= 0 && nx < width && ny >= 0 && ny < height) {
if (isEmpty(nx, ny)) {
moves.add(new int[]{nx, ny});
} else {
if (isEnemy(nx, ny, piece.isWhite())) {
moves.add(new int[]{nx, ny});
}
break;
}
nx += dir[0];
ny += dir[1];
}
}
}
if (type == PieceType.Queen) {
// Combine Rook + Bishop
int[][] directions = {{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
for (int[] dir : directions) {
int nx = x + dir[0];
int ny = y + dir[1];
while (nx >= 0 && nx < width && ny >= 0 && ny < height) {
if (isEmpty(nx, ny)) {
moves.add(new int[]{nx, ny});
} else {
if (isEnemy(nx, ny, piece.isWhite())) {
moves.add(new int[]{nx, ny});
}
break;
}
nx += dir[0];
ny += dir[1];
}
}
}
if (type == PieceType.Knight) {
// 8 mouvements possibles
int[][] jumps = {{2,1},{1,2},{-1,2},{-2,1},{-2,-1},{-1,-2},{1,-2},{2,-1}};
for (int[] jump : jumps) {
int nx = x + jump[0];
int ny = y + jump[1];
if (nx >= 0 && nx < width && ny >= 0 && ny < height) {
if (isEmpty(nx, ny) || isEnemy(nx, ny, piece.isWhite())) {
moves.add(new int[]{nx, ny});
}
}
}
}
if (type == PieceType.King) {
// 8 directions, une seule case
int[][] directions = {{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
for (int[] dir : directions) {
int nx = x + dir[0];
int ny = y + dir[1];
if (nx >= 0 && nx < width && ny >= 0 && ny < height) {
if (isEmpty(nx, ny) || isEnemy(nx, ny, piece.isWhite())) {
moves.add(new int[]{nx, ny});
}
}
}
} }
return moves; return moves;