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 Solvers311
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6799 Solvers
-
Maximum running product for a string of numbers
2257 Solvers
-
996 Solvers
-
654 Solvers
-
String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values
2048 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!