public class MineSweeper {
private static final int ROWS = 9;
private static final int COLS = 9;
private static final int MINES = 10;
private boolean[][] mines;
private int[][] board;
public MineSweeper() {
mines = new boolean[ROWS][COLS];
board = new int[ROWS][COLS];
placeMines();
updateBoard();
}
private void placeMines() {
for (int i = 0; i < MINES; ) {
int row = (int) (Math.random() * ROWS);
int col = (int) (Math.random() * COLS);
if (!mines[row][col]) {
mines[row][col] = true;
i++;
}
}
}
private void updateBoard() {
for (int i = 0; i < ROWS; i++) {
for (int j = 0; j < COLS; j++) {
if (!mines[i][j]) {
board[i][j] = countMines(i, j);
}
}
}
}
private int countMines(int row, int col) {
int count = 0;
for (int i = Math.max(row - 1, 0); i <= Math.min(row + 1, ROWS - 1); i++) {
for (int j = Math.max(col - 1, 0); j <= Math.min(col + 1, COLS - 1); j++) {
if (mines[i][j]) {
count++;
}
}
}
return count;
}
public int[][] getBoard() {
return board;
}
public boolean isMine(int row, int col) {
return mines[row][col];
}
public static void main(String[] args) {
MineSweeper game = new MineSweeper();
int[][] board = game.getBoard();
for (int[] row : board) {
for (int cell : row) {
System.out.print(cell + " ");
}
System.out.println();
}
}
}
java实现扫雷小游戏
最新推荐文章于 2024-05-01 14:13:15 发布