|
|
|||||||||
|
|||||||||
|
|||||||||
| |||||||||
![]() |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Display Modes |
|
|
|
Ajax Application Generator Generate database and reporting .NET Web apps in minutes. Quickly create visually stunning, feature-rich apps that are easy to customize and ready to deploy. Download Now!
|
|
#1
|
|||
|
|||
|
Auto Minesweeper Solver
Hi. Im looking for source code for a piece of software that automaically completes minesweeper. (Yeah cheating I know :-) ) I've seen software on the internet that does this but none of the creators will share the source code. Does anyone know of source code that does this, or can anyone make the code?
I preferably want the type that analyses the screen to work out the moves to make, rather than the type that reads the memory. |
|
#2
|
||||
|
||||
|
let me guess, for MSN 6.0 games?
lol... cheat... =P I've never even heard of this type of program... is it specifically for the Minesweeper in windows, or all minesweeper games? |
|
#3
|
|||
|
|||
|
The auto-solver i've currently got is for the minesweeper that came with windows. I dont mind whether it works with all versions of minesweeper or just the standard windows one. But the author of the solver i've got won't share the source code, which is a shame because their solver completed the expert mode in 2 seconds!
|
|
#4
|
||||
|
||||
|
Windows Minesweeper used to save its stats in an INI file in the windows folder... you could make it say expert in 0 seconds if you want... this was back on Windows 3.11... not sure if it still operates like this.
If its only the score you want to change, look into that. |
|
#5
|
|||
|
|||
|
Yes that does work, but I want to understand how the auto-solving software works. Getting a better score is good but I want to learn something too.
|
|
#6
|
||||
|
||||
|
Heh, I like your attitude...
Well, aside from the cheating on simple windows games... =) Have you tried searching sourceforge, or other open-source forums? Perhaps even coding your own simple Minesweeper would help you understand how to "reverse engineer" (so-to-say) the operations of it... |
|
#7
|
|||
|
|||
|
I am developing a solver myself for my university major project. To be honest most of the solvers on the net are pretty bad.
Mine will have a feature that will allow you to step through every move the solver makes to help you learn minesweeper. That might be the sort of thing you are looking for, but its not quite ready yet. With my version of minesweeper you can have boards of upto 100 million squares. It currently solves a 1000x1000 sized board with 10% mines in 650 ms and a 7000x7000 board with 4.9 million mines in 45 seconds. I would not release the source code though, I have to admit. To get a basic solver up and running is really very very easy, to make it a complete but fast solver is where it starts to get a little more difficult. |
|
#8
|
||||
|
||||
|
I remember (from 3.11 days I think) minesweeper used to have an easter egg, which when activated, you could hover over a square, and the top right (or left) or the screen would go black or white, depending on whether the sqaure was safe or not...
|
|
#9
|
|||
|
|||
|
Minesweeper Cheat
Quote:
Stuck on a move in MineSweeper? I wrote a program to tell you the probability of a cell having a mine in any senerio. Here's a snapshot http://wave.prohosting.com/mars8472/Mine_Solver2.jpg and here's the program http://wave.prohosting.com/mars8472/Minesweeper_Solver_2.exe I looked all over the internet for something like this and couldn't find it so I just made enjoy! |
|
#10
|
|||
|
|||
|
Minesweeper Solver Webpage
http://wave.prohosting.com/mars8472/minesweeper.html
|
|
#11
|
|||
|
|||
|
My friend wrote an auto-solver in C++ that he's optimized to one second. Actually, he timestamped it start to finish and it takes about 1/5 of a second. He won't show me the source code either. I can figure out the algorithm, but I'm having trouble with the mouse events.
His program dynamically finds any open instances of minesweeper on the desktop and solves them. You can optionally slow it down and watch the algorithm go to work.....really cool. |
|
#12
|
|||
|
|||
|
minesweeper
mine would be that fast too if i wrote it in c++ using registers would be a lot faster i applied every shortcut algorithum in my program.
|
|
#13
|
|||
|
|||
|
thinking about writing a minesweeper solver
hi guys, i'm thinking about writing one for an AI project.
i was thinking about using bayesian networks. think thats a good idea? wondering has anyone tried this b4? am i opening a can of worms? am i asking for trouble? wondering if there is an open source MS gui, that i could attach my solver too, i've never written a gui b4. thanks guys. |
|
#14
|
|||
|
|||
|
Hi, I have been developing a Minesweeper solver which solves most boards, but is not totally complete, it uses a logic representation of the board. I was reading the posts and saw that one solver did the expert in 2 seconds, isn't this quite slow, I mean mine can do it in 2/3 of a sec? I was also wondering about Safe_Gaz's solver, it seems very fast indeed but is it capable of solving any human solvable Minesweeper instance (complete), or are there certain situations in which it cannot work? Finally for Marsh8472, how does your solver produce the probabilities? I read somewhere on the web that the probabilities of adjacent cells cannot be mathematically combined. So how have you managed it? Or have you got a different method? I originally thought that as each cell is probed new probs could be calulated, by taking the average prob of a mine in any unknown cell and for each cell adding the probability of there being a mine in it by taking into account its adjacent numbers. Ok that may seem a bit messy, here's an example: say there are 102 cells, 2 of which are probed and they are adjacent, there are 10 mines, so the avarage prob is 0.1 (10/100). The two cells are a 2 and a 3, each with 7 neighbours 4 of which overlap:
.......... ...???... ...?2?... ...?3?... ...???... .......... So for the non overlapping ones of the 2, the prob would be 0.1 + 2/7 and for the non overlapping ones of the 3 the prob would be 0.1 + 3/7 then for the overlapping ones 0.1 + 2/7 + 3/7. Get it?! Anyways this doesn't work as sometimes you get probs over 1, so how have you done it? Thanks. |
|
#15
|
|||
|
|||
|
Quote:
How do you calculate your probs? |
|
#16
|
|||
|
|||
|
A classmate and I have also written a solver for an AI class.
You can find the executable and C++ source code at http://www.universitopia.com/AI.html. The program works with the Windows version. It has solved Expert mode in under half a second on my laptop. On average I would say it solves Expert mode 25-30% of the time. You can tell it to play many games (like 100 or 500) in a row so it's easy to gather stats. The probabilities could use more work, but we used a method that was more mathematically sound and it resulted in a lower success rate, so who knows! Feel free to use or modify the source code, but please give credit where credit is due. I'd be interested in knowing about anyone using the code, so feel free to email me. |
|
#17
|
|||
|
|||
|
Hi i made one at ZuluK.com/files/TempMSB_Demo_v_I.jnlp Its not as fast as some of the others, but I would be willing to share snippets of the source ie the main part that tells you the minesweeper logic if you email me for it. Instructions for use of the program are - you have to have windows xp and the java runtime - unobstruct the board, hit calibrate, wait a minute, and then click the other buttons after it's calibrated to 'play'.
|