This Puzzle is a form of the classical MS Minesweeper which keeps popping into my head. In Minesweeper, a 2D grid is filled with mines and numbers whereas each number represents how many of its 8 adjacent tiles are occupied by mines.
The main rule of this puzzle is that only two types of tiles may be used: Mines (m) and one number. So instead of using all numbers ranging from 0(blank) to 8, you have to select only one of it (except 0) and fill a rectangular grid with it. Of course, the Minesweeper rules still apply so the numbers must still represent the number of adjacent mines.
The grid size can be freely chosen but must not be infinite so whatever pattern you may find must work with the edges as well. I do not yet have solutions for all numbers but some of them. As an example, here are the trivial solutions for 1 and 8:
Example (1)
+- - - - - - - - - - - - +
|1 1 1 1 1 1 1 1 1 1 1 1 |
|1 m 1 1 m 1 1 m 1 1 m 1 |
|1 1 1 1 1 1 1 1 1 1 1 1 |
|1 1 1 1 1 1 1 1 1 1 1 1 |
|1 m 1 1 m 1 1 m 1 1 m 1 |
|1 1 1 1 1 1 1 1 1 1 1 1 |
+- - - - - - - - - - - - +
Example (8)
+- - - - - - - - - +
|m m m m m m m m m |
|m 8 m m 8 m m 8 m |
|m m m m m m m m m |
|m m m m m m m m m |
|m 8 m m 8 m m 8 m |
|m m m m m m m m m |
+- - - - - - - - - +
Note: The above examples do not work for arbitrary grid sizes, only for multiples of 3 in both axes. Such restrictions are allowed for the solutions. Just make sure they are large enough so that an actual pattern can be identified
Note: You can use any notation for the mines you like as with some numbers, some characters are better distinguishable than others