#include #include #include #include /* I was pattern printing. Just a coincidence that it even turned out to be a maze. Don't expect legit maze generation though - It can be a good reference but still needs touch up. :D */ const int ROW = 25; const int COL = 19; const std::string maze_fill = "ll"; const std::string maze_path = " "; void initialize_maze(std::string maze[ROW][COL]) { for (int i = 0; i < ROW; i++) for (int j = 0; j < COL; j++) maze[i][j] = maze_fill; } void set_start_pt(std::string maze[ROW][COL], int& current_row, int& current_col) { current_row = (rand() % (ROW/2)) * 2 + 1; current_col = (rand() % (COL/2)) * 2 + 1; maze[current_row][current_col] = maze_path; } void generate_path(std::string maze[ROW][COL], int& current_row, int& current_col) { int direction; int iteration = 0; bool isDone = false; while (!isDone && iteration < 15) { direction = rand() % 4; switch(direction) { case 0: if (!(current_row - 2 < 0)) if (maze[current_row - 2][current_col] != maze_path) { maze[current_row - 1][current_col] = maze_path; maze[current_row - 2][current_col] = maze_path; current_row -= 2; isDone = true; } break; case 1: if (!(current_row + 2 >= ROW)) if (maze[current_row + 2][current_col] != maze_path) { maze[current_row + 1][current_col] = maze_path; maze[current_row + 2][current_col] = maze_path; current_row += 2; isDone = true; } break; case 2: if (!(current_col - 2 < 0)) if (maze[current_row][current_col - 2] != maze_path) { maze[current_row][current_col - 1] = maze_path; maze[current_row][current_col - 2] = maze_path; current_col -= 2; isDone = true; } break; case 3: if (!(current_col + 2 >= COL)) if (maze[current_row][current_col + 2] != maze_path) { maze[current_row][current_col + 1] = maze_path; maze[current_row][current_col + 2] = maze_path; current_col += 2; isDone = true; } break; } iteration++; } if (!isDone) set_start_pt(maze, current_row, current_col); } void print_maze(std::string maze[ROW][COL]) { for (int i = 0; i < ROW; i++, std::cout << std::endl) for (int j = 0; j < COL; j++) std::cout << maze[i][j]; } int main() { srand(time(0)); std::string maze[ROW][COL]; int row, col; initialize_maze(maze); set_start_pt(maze, row, col); for (int i = 0; i < (ROW+COL) * 10; i++) generate_path(maze, row, col); print_maze(maze); return 0; }

Random Maze Generator