I was counting on writing the minesweeper client myself. It will query
your programs for one move at a time until the board is done, or a mine
is uncovered.
I will post a tentative set of rules soon.
Jeff Cameron
--~--~-~--~~~---~--~~
You received this
Hello algorithm enthusiasts! I recently became interested in
Minesweeper-solving algorithms, and would like to propose a
competition.
We will each write a C/C++/Java function that takes a minesweeper
board, along with its width and height, and then returns which square
to click next. For
RE: If you have an algo for this probabibility calculation, until you
find
a square with 100% safety, (or the safest square on the board), you
have minesweeper solved as well as it can be.
In fact, this is not true. Simply selecting the square that minimizes
the probability of uncovering a
