The document provides instructions for implementing a JavaFX application featuring a 10x10 button grid for a game similar to Minesweeper. Initially, all buttons are hidden except for one, with surrounding buttons revealed when clicked based on their positions. It includes the creation of a bomb grid and calculates the number of adjacent bombs for each cell, along with handling boundary cases.

1. Hint 1: 2D array of type Button, all buttons hidden except for one
Hint 2: Add Insets and horizontal and vertical gaps
Hint 3: The button text will correspond to the two dimensional position in the button array, i.e.
the button in the top left corner at row zero column zero is labeled 00. Up to you if you want to
label them rowcolumn or columnrow
Hint 4: Math.random creates random numbers between 0 and 1
Hint 5: .setVisible( true ) shows a button, .setVisible( false ) hides it.
Hint 6: Be careful not to try to uncover buttons that are out of bounds
Hint 7: .getSource to get the event source object, .getText gets the text from the button, use
already known methods and wrapper classes to get the numeric value You are to implement a
JavaFX application containing a well formatted 10x10 button grid. Each button is labeled with
two digits one for the row and one for the column. The program starts out with all buttons hidden
except for one. The initial button should be decided at random. When a button is clicked, all of
its surrounding buttons are uncovered If e.g. the button 64 is clicked, all not already visible valid
buttons around it are to appear-buttons 53, 54, 55, 63, 65 73, 74, 75. However, for the button 00,
the only valid buttons are 01, 10, and 11 53 54 55 000 01 63 64 65 10 11 73 74 75
Solution
public class Minesweeper { public static void main(String[] args) { int m =
Integer.parseInt(args[0]); int n = Integer.parseInt(args[1]); double p =
Double.parseDouble(args[2]); // game grid is [1..m][1..n], border is used to handle
boundary cases boolean[][] bombs = new boolean[m+2][n+2]; for (int i = 1; i <= m;
i++) for (int j = 1; j <= n; j++) bombs[i][j] = (Math.random() < p); // print
game for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) if
(bombs[i][j]) System.out.print("* "); else System.out.print(". ");
System.out.println(); } // sol[i][j] = # bombs adjacent to cell (i, j) int[][] sol = new
int[m+2][n+2]; for (int i = 1; i <= m; i++) for (int j = 1; j <= n; j++) // (ii,
jj) indexes neighboring cells for (int ii = i - 1; ii <= i + 1; ii++) for (int jj =
j - 1; jj <= j + 1; jj++) if (bombs[ii][jj]) sol[i][j]++; // print solution
System.out.println(); for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) {
if (bombs[i][j]) System.out.print("* "); else System.out.print(sol[i][j] + "
"); } System.out.println(); } } }