I didn't look into thecorrectness of the algorithm.
But I can tell you the reason for that compilation error
Visual Studio 6.0 does not follow ANSI standards!
Especially the scope of the loop variable 'i' is the thing which causes compilation error for you.
In ANSI C (or gcc for that matter),
if
Hi,
I'm interested!!
And, I've coded a Minespweeper a few months ago.
Let me know if you are interested on it!
Flávio
JeffCameron wrote:
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
Flávio Barata wrote:
Hi,
I'm interested!!
And, I've coded a Minespweeper a few months ago.
Let me know if you are interested on it!
Flávio
Absolutely, Flavio!
Watch for Jeff's announcement. The more programs, the better.
(may not some changes in it to work with the contest, however).
Hi Jeff,
Its quite a good idea atleast we must start with, but are we just
finding next square to be clicked or sequence of such things.
Please let me know, although i do not have much idea about the probab.
Still wanna try it.
Thanx for such Idea
Kapil
In order to get some kind of statistically significant sampling, we'll
need the programs to run games, completely automated, from an identical
file of random starting positions.
At least 100 games should be played by each program, imo. Since the
games will play VERY fast, running time should be
adak wrote:
What else do we need to know and agree on?
Do players know the number of mines?
What is the scoring system? Is it better to completely clear 50% of
the boards, but not much more than 50% of the total squares, or to
clear 75% of the total squares, but not much more than 10% of the
wade wrote:
adak wrote:
What else do we need to know and agree on?
Do players know the number of mines?
Normal would be 40 mines on the intermediate (16 x 16) board.
What is the scoring system?
Your score would be the number of mined squares you succeeded in
marking correctly during the
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
You're right Jeff, but the amount of improvement is quite small, imo.
A lookahead function seems needed in certain situations to decrease the
number of the guesses that may have to be made, even though the
probability of choosing a mined square on the next choice, is somewhat
higher.
I just
Hi Jeff,
Glad to hear you say on average in judging the algorithm's, because
minesweeper is all about probablities, imo. Even the best algo could be
foiled by an unlucky guess.
If you have an algo for this probabibility calculation, until you find
a square with 100% safety, (or the safest
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
11 matches
Mail list logo
