/* This code was posted on "Sololearn Playground" by Mihai Dancaescu You are allowed to modify the code (except this comment which you are prohibited to), but (please) don't repost it. */ /* ▄████▄░▄████▄░░▄██░█████░░░░░█░█░█▀█░█▀█░█▀█░█░█ ▀▀░▄██░██░░██░▀░██░░░░██░░░░░█▀█░█▀█░█▀▀░█▀▀░▀█▀ ▄██▀░░░██░░██░░░██░░░██░░░░░░▀░▀░▀░▀░▀░░░▀░░░░▀░ ██████░▀████▀░░░██░░██░░░█▄░█░█▀▀░█░█░█░░█░█░█▀▀░█▀█░█▀█ ░░░░░░░░░░░░░░░░░░░░░░░░░█░██░█▀▀░█░█░█░░▀█▀░█▀▀░█▀█░██▀ ░░░░░░░░░░░░░░░░░░░░░░░░░▀░░▀░▀▀▀░░▀▀▀░░░░▀░░▀▀▀░▀░▀░▀░▀ (http://steamcommunity.com/discussions/forum/12/154645299384827744/) (use a tablet/pc to view this/\) */ /* I found this code in my dropbox. :) Also see https://code.sololearn.com/c9fXXjMgl9b8/?ref=app */ #include #include #include #include ///--------------------------------------------------------------------------------------------------------- #define MAZE_SIZE 21 // <- Change this number to change the maze's size (works for odd numbers only, max 85) ///--------------------------------------------------------------------------------------------------------- #define MAX 173 /// 86 * 2 + 1 = 173 #define CELL 7500 /// 86 * 86 = 7396 #define WALL 1 #define PATH 0 using namespace std; void init_maze(int maze[MAX][MAX]); void maze_generator(int indeks, int maze[MAX][MAX], int backtrack_x[CELL], int bactrack_y[CELL], int x, int y, int n, int visited); void print_maze(int maze[MAX][MAX], int maze_size); int is_closed(int maze[MAX][MAX], int x, int y); int main(void) { srand((unsigned)time(NULL)); int size = MAZE_SIZE / 2; int indeks = 0; int maze[MAX][MAX]; int backtrack_x[CELL]; int backtrack_y[CELL]; init_maze(maze); backtrack_x[indeks] = 1; backtrack_y[indeks] = 1; maze_generator(indeks, maze, backtrack_x, backtrack_y, 1, 1, size, 1); maze[0][1]= maze[size * 2][size * 2 - 1] = ' '; print_maze(maze, size); //getch(); return 0; } void init_maze(int maze[MAX][MAX]) { for(int a = 0; a < MAX; a++) { for(int b = 0; b < MAX; b++) { if(a % 2 == 0 || b % 2 == 0) maze[a][b] = 1; else maze[a][b] = PATH; } } } void maze_generator(int indeks, int maze[MAX][MAX], int backtrack_x[CELL], int backtrack_y[CELL], int x, int y, int n, int visited) { if(visited < n * n) { int neighbour_valid = -1; int neighbour_x[4]; int neighbour_y[4]; int step[4]; int x_next; int y_next; if(x - 2 > 0 && is_closed(maze, x - 2, y)) // upside { neighbour_valid++; neighbour_x[neighbour_valid]=x - 2;; neighbour_y[neighbour_valid]=y; step[neighbour_valid]=1; } if(y - 2 > 0 && is_closed(maze, x, y - 2)) // leftside { neighbour_valid++; neighbour_x[neighbour_valid]=x; neighbour_y[neighbour_valid]=y - 2; step[neighbour_valid]=2; } if(y + 2 < n * 2 + 1 && is_closed(maze, x, y + 2)) // rightside { neighbour_valid++; neighbour_x[neighbour_valid]=x; neighbour_y[neighbour_valid]=y + 2; step[neighbour_valid]=3; } if(x + 2 < n * 2 + 1 && is_closed(maze, x + 2, y)) // downside { neighbour_valid++; neighbour_x[neighbour_valid]=x+2; neighbour_y[neighbour_valid]=y; step[neighbour_valid]=4; } if(neighbour_valid == -1) { // backtrack x_next = backtrack_x[indeks]; y_next = backtrack_y[indeks]; indeks--; } if(neighbour_valid!=-1) { int randomization = neighbour_valid + 1; int random = rand()%randomization; x_next = neighbour_x[random]; y_next = neighbour_y[random]; indeks++; backtrack_x[indeks] = x_next; backtrack_y[indeks] = y_next; int rstep = step[random]; if(rstep == 1) maze[x_next+1][y_next] = PATH; else if(rstep == 2) maze[x_next][y_next + 1] = PATH; else if(rstep == 3) maze[x_next][y_next - 1] = PATH; else if(rstep == 4) maze[x_next - 1][y_next] = PATH; visited++; } maze_generator(indeks, maze, backtrack_x, backtrack_y, x_next, y_next, n, visited); } } void print_maze(int maze[MAX][MAX], int maze_size) { for(int a = 0; a < maze_size * 2 + 1; a++) { for(int b = 0; b < maze_size * 2 + 1; b++) { if(maze[a][b] == WALL) printf("#"); else printf(" "); } printf("\n"); } } int is_closed(int maze[MAX][MAX], int x, int y) { if(maze[x - 1][y] == WALL && maze[x][y - 1] == WALL && maze[x][y + 1] == WALL && maze[x + 1][y] == WALL ) return 1; return 0; }

Random maze generator