Best viewed with Mozilla Firefox at 1024×768×24 or higher.
You can highlight certain texts to get a fuller description. Please try it, because I think it's pretty neat. :-)
Everybody loves blowing other people up. That is why some guy invented the mine-induced game of MineSweeper. Since then, there has been countless number of records broken, and ununimagonable number of variations of the game. It has also been written on many systems and platforms. Today, MineSweeper is introduced to the WinDS system through WinSweeper.
To install WinSweeper, you must first have downloaded the WinSweeper library. Once you have set up your environment, you can link the library with your WinDS application loader. Include the file “App_WinSweeper.h” in your program, and declare a new “appWinSweeper” variable. After that, simply run the “Install” method of “appWinSweeper”. Here is an example “apploader” file.
// WinDS AppLoader
// Installs custom WinDS applications
#include <winsapi.h>
#include <App_WinSweeper.h>
const appWinSweeper AppWinSweeper;
void InstallApps()
{
AppWinSweeper.Install();
};
Running the application is even easier than installing it. Once you have your WinDS binary compiled, run it on an emulator or on the Nintendo DS hardware. Once you get to the desktop, double-click on the WinSweeper icon. The game window should now pop up. You are ready to play WinSweeper.
If you are in search of a good MineSweeper guide, please look elsewhere. I am the worse resource for examples and explanations of the game, so please do not bother trying to figure out what I am saying.
To win MineSweeper, you must locate all of the mines without blowing yourself up. To do this, you are given a board. When you click on a mine space, scouts are sent out to see if their mine-o-meters detect a mine nearby. When they do, the numbers are reported back to the user and shown on the field.
What do these numbers mean to you? They show the user how many mines are around that space. For example, if the mine-o-meter displays “8,” that means that eight mines surround the square. You now know that the squares above, below, to the left, to the right, and in each diagonal are mines.
So, now what? Click on another square, that does not surround the eight, and hope that it isn't a mine. Luckily, your scouts indicate a zero for the mine you selected, but found that the squares around the one the user specified had “1” shown on the mine-o-meters. The user quickly calculates that no mine can be two spaces to the left, right, top, or bottom of the origionally selected square. Scouts are sent there, and more numbers are descovered.
Of course, this just scratches the surface. There are many techniques people use to find out where a mine would be and will not be. You have to either find your own technique, or look at a better guide to MineSweeper somewhere on the Web. Also, to lose, you must click on a square with a mine on it. This should show the entire mine field.
std::rand()
function, which is pseudo-random.