Dude if you can really solve minesweeper, publish the paper and become famous and rich, because that shit is NP-complete.
http://www.cs.montana.edu/courses/spring2004/spring2004/curr...
http://www.cs.montana.edu/courses/spring2004/spring2004/curr...
OP would only be rich & famous if they had developed an algorithm that solved minesweeper in polynomial or better time. (i.e., a time complexity on the order of O(n^k), where k is some constant)
Many NP-Complete problems are trivially solvable, just not trivially solvable in an efficient manner. - like the Travelling Salesman Problem. You can just try every possible combination. It's not fast, but it works.