Background
In mine-hunting games (e.g. Microsoft Minesweeper), the user is provided with a covered grid that, upon a left click, uncovers a hint as to the bombs around it or a bomb itself. The goal of this problem is to generate this grid based on the placement of a number of bombs and the puzzle size.
More information can be found on the Wikipedia page.
Description
You are provided with the row and column of K mines on a grid, I and J respectively, as well as the number of rows and columns on the grid, M and N respectively. Using this information, generate an M x N grid where the values on the grid represent the number of mines adjacent to that square or, if there is a mine on that particular square, the value -1.
Example
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers315
Suggested Problems
-
2612 Solvers
-
Replace NaNs with the number that appears to its left in the row.
3074 Solvers
-
The Answer to Life, the Universe, and Everything
588 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1307 Solvers
-
Calculate Amount of Cake Frosting
30971 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!