C Programming From practice Final
Problem 5 (33 points) MINESWEEPER is a well-known single-player puzzle game. The objective of the game is to clear a rectangular grid containing hidden "mines, in some of its squares, without detonating any of them. The user is initially presented with a grid of unrevealed squares, which may look like this 21 I I 4I Some randomly selected squares, unknown to the user, are designated to contain mines. For example, using to denote a mine, it is possible that there are 7 mines located as follows: 4Il The value of a square that does not contain a mine is defined as the number of mines adjacent to this square. Such values can thus range from 0 to 8, since every square in the grid has at most 8 neighbors. For example, if the mines are as shown above, the values of the remaining squares are as follows: 11131 12 215131 4 1311210 To play the game, the user asks the computer to reveal the value of a square by indicating its coordi nates (i,j). If the square does not contain a mine, its value is revealed and the game continues, with The user asks to reveal the value of a square that contains a mine. In this case, the mine The values of all the squares that do not contain a mine have been revealed _then the the user asking to reveal the value of another square. The process repeats until either deton ates and the user immediately loses the game; or remaining squares are precisely the mine locations. In this case, the user wins the game. For example, if the mines are located as illustrated above, the game might proceed as shown on the next page, terminating with a loss when the user steps on the mine in location (2,4 Problem 5 (33 points) MINESWEEPER is a well-known single-player puzzle game. The objective of the game is to clear a rectangular grid containing hidden "mines, in some of its squares, without detonating any of them. The user is initially presented with a grid of unrevealed squares, which may look like this 21 I I 4I Some randomly selected squares, unknown to the user, are designated to contain mines. For example, using to denote a mine, it is possible that there are 7 mines located as follows: 4Il The value of a square that does not contain a mine is defined as the number of mines adjacent to this square. Such values can thus range from 0 to 8, since every square in the grid has at most 8 neighbors. For example, if the mines are as shown above, the values of the remaining squares are as follows: 11131 12 215131 4 1311210 To play the game, the user asks the computer to reveal the value of a square by indicating its coordi nates (i,j). If the square does not contain a mine, its value is revealed and the game continues, with The user asks to reveal the value of a square that contains a mine. In this case, the mine The values of all the squares that do not contain a mine have been revealed _then the the user asking to reveal the value of another square. The process repeats until either deton ates and the user immediately loses the game; or remaining squares are precisely the mine locations. In this case, the user wins the game. For example, if the mines are located as illustrated above, the game might proceed as shown on the next page, terminating with a loss when the user steps on the mine in location (2,4
