Minesweeper Game | 刷题

Minesweeper Game | 刷题

Design and implement the constructor of a minesweeper game that takes in the dimension of the field and number of mines as input.

/**
* Create a new game board with the given size and number of mines.  The
* mines are randomly distributed across the board.  Currently no error
* checking is done, so if numMines > width*height the program will hang.
*/
public Board(int width, int height, int numMines) {

    // Initialise instance variables.  Note the use of 'this' when parameters
    // have the same name.
    this.width = width;
    this.height = height;
    this.numMines = numMines;
    this.numMarked = 0;
    this.numUnknown = width * height;

    // Allocate storage for game board and mines
    mines = new boolean[width][height];
    board = new int[width][height];

    // Clear the board
    for (int i = 0; i < width; i++) {
        for (int j = 0; j < height; j++) {
            mines[i][j] = false;
            board[i][j] = UNKNOWN;
        }
    }

    // Randomly allocate mines.  The loop runs until numMines mines have been
    // placed on the board.  The the purposes of this operation we treat the
    // board as a width*height linear array of cells, and simply try again if
    // the chosen cell already contains a mine.
    int cells = width * height;
    int temp = 0;
    Random rand = new Random();

    while (temp < numMines) {
        int cell = rand.nextInt();
        cell = (cell < 0 ? -cell : cell)%cells;
        if (!mines[cell%width][cell/width]) {
            mines[cell%width][cell/width] = true;
            temp++;
        }
    }
}

http://www.eecs.qmul.ac.uk/~mmh/ItP/resources/MineSweeper/Notes.html

Read full article from Minesweeper Game | 刷题