Somewhat OT... Computer playing Minesweeper

[Scott David Daniels]

Heiko Wundram wrote:

> What the computer then does is evaluate the histogram: If a position has 
> probability zero of having a mine: discover it, if it has possibility one: 
> mark it, and only if there are no positions which have possibility zero or 
> one: 

So far so good.

 > discover a random field from the list of fields which have the lowest
> probability of having a mine.

Here improvement is possible.  You want the move that has the greatest 
expected useful information (where "Boom" is very un-useful information).
Your algorithm may be taking a number low-risk gambles with low payoff.
One measure of payoff might be "how many squares are revealed?"

You also don't track "how many undiscovered mines are out there" -- that
might provide answers to collapse consistent states.

-- 
-Scott David Daniels
Scott.Daniels at Acm.Org