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
-
Project Euler: Problem 2, Sum of even Fibonacci
2886 Solvers
-
630 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
560 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
265 Solvers
-
The Answer to Life, the Universe, and Everything
582 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!