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 Solvers314
Suggested Problems
-
424 Solvers
-
174 Solvers
-
Sum of diagonal of a square matrix
1645 Solvers
-
723 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
461 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!