Contribute to MineSwee++ 2

Although I think C[o]re is quite smart, there's always a way to improve it. Or, better yet, perhaps we can teach [o] a new and more clever algorithm. So, if you have a good way to find out which grid has the best possibility of containing a mine, why not share with us? ;)

Please read the following if you want to contribute a new way to solve the mine board, thanks :)

• Please solve the mine board that:
  1. Uses the coordinate system with the top-left grid positioned (0,0) and bottom-right grid positioned (15,15)
  2. has (7,10), (10,6) and (13,13) marked "1"
  3. Has (3,6), (4,7), (8,4) and (13,14) marked "2"
  4. Has (4,5) marked "3"
  5. Has (5,5) marked "4"
  6. Has (5,4), (5,7) and (14,15) flagged as mines
• What you have to do:
  1. Calculate every unopened grid's (absolute or relative) possibility of containing a mine.
  2. Calculate every unopened grid's (absolute or relative) possibility of having no mines around.
  3. Decide which grid to open according to these two factors.
• There might be some other parameters affecting the decision on opening which grid, please address them too.
• As for programming language, please use Visual Basic 6/7/8, C/C++/C#, Java, PHP, python, Ruby or (Intel IA-32) Assembly. Any involved arrays should be row-major.
• Explain your example codes in conjuction with concepts as detailedly as possible. Explain every variable you use in the codes too.
• You may alternatively use any commonly-used pseudo-codes, but please make sure they are implementable and don't run in the time/space complexity of an awful exponential growth rate.
• Give your algorithm a cool name. It will go like [o]-[ALGORITHMNAME] or Xxx[o]xxx (like C[o]re).

Interested? Please head for official thread and post about your thoughts ;) And er, you will get no reward but having your name shown in About Box.