In Python:

Minesweeper. Compose a program that takes three command-line arguments m, n, and p and produces an m-by-n boolean array where each element is occupied with probability p. (p is expressed as a 2 decimal float). In the minesweeper game, occupied cells represent bombs and empty cells represent safe cells. Write the array using an asterisk for bombs and a period for safe cells. Then, replace each safe square with the number of neighboring bombs (above, below, left, right, or diagonal) and write the result, as in this example.

 * * . . . * * 1 0 0 . . . . . 3 3 2 0 0 . * . . . 1 * 1 0 0

Try to express your code so that you have as few special cases as possible to deal with, by using and (m+2)-by-(n+2) boolean array.