minesweeper

I am creating a simple 9x9 grid for Minesweeper. One of the primary functions of this game is to have a recursion to check all the sides when the tile clicked has no bombs surrounding it. In the code attached below, I have been able to create a function that checks the upper and left side of the tile. If I add more directions, such as lower and right side, the program will crash and will not properly display the tiles. (Check the method countBorders under the line //MY MAIN PROBLEM ) //displays the main GUI package Minesweeper4; public class mainFrame { public static void main(String[] args) {

I am pretty sure most of you know about the minesweeper game. I wanted to code (in C#) my own minesweeper game and was looking for some input as to what would be a good algorithm for that game. I have been browsing over the web for quite some time now but could not find a good solution. Can anyone help me with it? Generating the grid is simple. There are a couple simple algorithms that you need when executing the player's move, to determine which squares to open up and whether they have lost or won. Generating the grid The simplest algorithm is to place all of the mines randomly. (Make sure

This question already has an answer here: Why does rand() yield the same sequence of numbers on every run? 6 answers I just finished coding a Minesweeper type game, and everything's good except for that each time I run the application, it generates the same number (I ran it 3 different times, saved the output to 3 text files and used the diff command in Linux, it didn't find any differences). It's seeded by time(NULL) so it should change every time, right? Here's my code: main.cpp #include <iostream> #include <cstdlib> #include <time.h> #include <string> #include "Minesweeper/box.h" #include