Method Generate

Applications/Minesweeper/main.cpp:81–145

    }

    void Generate(int diff){
        if(tiles){
            for(int i = 0; i < mapSize.y; i++){
                delete tiles[i];
            }

            delete tiles;
        }

        difficulty = diff;

        mapSize = difficultySizes[difficulty];
        int mineCount = difficultyMineCounts[difficulty];

        bounds = {0, 0, mapSize.x * 16, mapSize.y * 16};
        UpdateFixedBounds();

        tiles = new Tile*[mapSize.y];
        for(int i = 0; i < mapSize.y; i++)
            tiles[i] = new Tile[mapSize.x];

        
        timespec bTime;
        clock_gettime(CLOCK_BOOTTIME, &bTime);
        srand(bTime.tv_sec + bTime.tv_nsec);

        while(mineCount--){
            int x = rand() % mapSize.x;
            int y = rand() % mapSize.y;
            
            int i = 8;
            while(tiles[y][x].type == MineTile && i--){ // Do not place a mine on a tile that already has a mine, try 8 times
                x = rand() % mapSize.x;
                y = rand() % mapSize.y;
            }

            tiles[y][x].type = MineTile;
        }

        for(int y = 0; y < mapSize.y; y++){
            for(int x = 0; x < mapSize.x; x++){
                Tile& tile = tiles[y][x];

                tile.hidden = true;
                tile.flagged = false;

                if(tile.type == MineTile)
                    continue; // Don't calculate surrounding mines for mine tiles

                for(int i = std::max(0, y - 1); i <= y + 1 && i < mapSize.y; i++){
                    if(x - 1 >= 0 && tiles[i][x - 1].type == MineTile){
                        tile.surroundingMines++;
                    }

                    if(tiles[i][x].type == MineTile){
                        tile.surroundingMines++;
                    }