I'm not sure if this is a linear algebra problem...Sorry if it does not belong in this section of the forum.

If I had a 20 by 20 game of minesweeper, what would be the maximum amount of number 2s I could have with any amount of bombs. Could you help me deduce an equation or algorithm for this sort of thing? Right now I have 440 2s, but this is not from any equation or algorithm - its from messing around with a matrix on paper.

This isn't a question for any class, or homework - its just something I was thinking about.

Thanks.