title: understanding the minesweeper programming p.roblem
body: <p>I am trying to understand the minesweeper problem: <br>
  <strong>Problem statement:</strong><br>
  Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can’t remember. The goal of the game is to ﬁnd where all the mines are located within a M ×N ﬁeld. The game shows a number in a square which tells you how many mines there are adjacent to that square. Each square has at most eight adjacent squares. The 4×4 ﬁeld on the left contains two mines, each represented by a “ * ” character. If we represent the same ﬁeld by the hint numbers described above, we end up with the ﬁeld on the right: <br>The test case<br> 
  <a href="https://i.stack.imgur.com/Z7PbG.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/Z7PbG.png" alt="here is the test case"></a></p>
  
  <p>I am not understanding the problem. just explain me the problem so that I could solve it on my own. PLEASE DO NO EXPLAIN THE SOLUTION.</p>
  
  <p>( I have already seen <a href="https://stackoverflow.com/questions/24598121/minesweeper-stackoverflowerror">this problem</a> and many others like this but they are  not talking  about the core programming problems , they are game projects. )</p>