*/ #include #include #include #include #include #include #include #include #define MAX_ROWS 23 #define MAX_COLS 99 #define LEVELS 20 #define FOG_START 13 /* from this level you can only see around you */ char maze[MAX_ROWS][MAX_COLS + 1]; int seen[MAX_ROWS][MAX_COLS]; /* 1 = cell is visible on screen */ int visited[MAX_ROWS][MAX_COLS]; /* used by the solver */ int rows, cols; /* size of current maze */ int px, py; /* player position (row, column) */ int ex, ey; /* exit position */ int radius; /* fog radius, 0 = no fog */ int totalMoves = 0, hintsUsed = 0, levelsWon = 0; long totalTime = 0; /* ---------- keyboard: read ONE key without pressing Enter ---------- */ int getKey(void) { struct termios oldt, newt; int ch; int isTerminal = (tcgetattr(STDIN_FILENO, &oldt) == 0); if (isTerminal) { newt = oldt; newt.c_lflag &= ~(ICANON | ECHO); tcsetattr(STDIN_FILENO, TCSANOW, &newt); } ch = getchar(); if (isTerminal) tcsetattr(STDIN_FILENO, TCSANOW, &oldt); return ch; } /* ---------- maze generation (recursive backtracking) ---------- */ /* Start in a cell, go to a random unvisited neighbour (2 steps away), knock down the wall in between, repeat. When stuck, go back. */ void carve(int r, int c) { int dr[4] = {-2, 2, 0, 0}; int dc[4] = {0, 0, -2, 2}; int order[4] = {0, 1, 2, 3}; maze[r][c] = ' '; for (int i = 3; i > 0; i--) { /* shuffle directions */ int j = rand() % (i + 1); int t = order[i]; order[i] = order[j]; order[j] = t; } for (int i = 0; i < 4; i++) { int d = order[i]; int nr = r + dr[d], nc = c + dc[d]; if (nr >= 1 && nr < rows - 1 && nc >= 1 && nc < cols - 1 && maze[nr][nc] == '#') { maze[r + dr[d] / 2][c + dc[d] / 2] = ' '; /* break wall */ carve(nr, nc); } } } /* Easy levels get extra openings (loops = many routes). Higher levels get fewer, so only ONE correct route remains. */ void addLoops(int lvl) { int extra = (rows * cols / 25) * (LEVELS - lvl) / (LEVELS - 1); int tries = 0; while (extra > 0 && tries < 5000) { int r = 1 + rand() % (rows - 2); int c = 1 + rand() % (cols - 2); tries++; if (maze[r][c] == '#' && (r + c) % 2 == 1) { maze[r][c] = ' '; extra--; } } } /* Levels 1-5: exit in the far corner. Levels 6+ : exit at the cell with the LONGEST path from the start (BFS). */ void placeExit(int lvl) { static int dist[MAX_ROWS][MAX_COLS]; static int qr[MAX_ROWS * MAX_COLS], qc[MAX_ROWS * MAX_COLS]; int dr[4] = {-1, 1, 0, 0}; int dc[4] = {0, 0, -1, 1}; if (lvl <= 5) { ex = rows - 2; ey = cols - 2; } else { int head = 0, tail = 0; for (int i = 0; i < rows; i++) for (int j = 0; j < cols; j++) dist[i][j] = -1; dist[1][1] = 0; qr[tail] = 1; qc[tail] = 1; tail++; ex = 1; ey = 1; while (head < tail) { int r = qr[head], c = qc[head]; head++; if (dist[r][c] > dist[ex][ey]) { ex = r; ey = c; } for (int d = 0; d < 4; d++) { int nr = r + dr[d], nc = c + dc[d]; if (maze[nr][nc] == ' ' && dist[nr][nc] == -1) { dist[nr][nc] = dist[r][c] + 1; qr[tail] = nr; qc[tail] = nc; tail++; } } } } maze[ex][ey] = 'E'; } /* Fog of war: mark cells near the player as visible (remembered later) */ void updateSeen(void) { for (int i = 0; i < rows; i++) for (int j = 0; j < cols; j++) if (radius == 0 || (abs(i - px) <= radius && abs(j - py) <= radius * 2)) seen[i][j] = 1; } /* Maze gets bigger every level: 9x21 (level 1) -> 23x99 (level 20) */ void generateLevel(int lvl) { rows = 9 + 2 * ((lvl - 1) * 7 / 19); cols = 21 + 2 * ((lvl - 1) * 39 / 19); for (int i = 0; i < rows; i++) { memset(maze[i], '#', cols); maze[i][cols] = '\0'; for (int j = 0; j < cols; j++) seen[i][j] = 0; } carve(1, 1); addLoops(lvl); placeExit(lvl); maze[1][1] = 'S'; px = 1; py = 1; radius = (lvl >= FOG_START) ? 10 - (lvl - FOG_START) : 0; updateSeen(); } const char *difficultyName(int lvl) { if (lvl <= 4) return "EASY"; if (lvl <= 8) return "MEDIUM"; if (lvl <= 12) return "HARD"; if (lvl <= 16) return "VERY HARD (fog)"; if (lvl <= 19) return "INSANE (fog)"; return "EXTREME (fog)"; } /* ---------- drawing ---------- */ void printMaze(int lvl, int moves) { printf("\033[2J\033[H"); /* clear screen */ printf("=== MAZE RUNNER | Level %d/%d | %s | %dx%d ===\n\n", lvl, LEVELS, difficultyName(lvl), rows, cols); for (int i = 0; i < rows; i++) { for (int j = 0; j < cols; j++) { if (i == px && j == py) putchar('P'); else if (seen[i][j]) putchar(maze[i][j]); else putchar(' '); } putchar('\n'); } printf("\nMoves: %d | Hints used: %d", moves, hintsUsed); if (radius > 0) printf(" | FOG: limited vision!"); printf("\nW/A/S/D = move, H = show solution, Q = quit: "); fflush(stdout); } /* Warn if the terminal window is too small for this level */ void checkTerminal(void) { struct winsize w; if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &w) == 0 && (w.ws_col < cols + 1 || w.ws_row < rows + 6)) { printf("\nThis level needs a window of at least %d columns x %d rows.\n", cols + 1, rows + 6); printf("Maximize your terminal, then press any key..."); fflush(stdout); getKey(); } } /* ---------- movement ---------- */ int isWall(int r, int c) { if (r < 0 || r >= rows || c < 0 || c >= cols) return 1; return maze[r][c] == '#'; } /* returns 1 if the move happened, 0 if blocked */ int movePlayer(int key) { int nr = px, nc = py; switch (key) { case 'w': nr--; break; case 's': nr++; break; case 'a': nc--; break; case 'd': nc++; break; default: return 0; } if (isWall(nr, nc)) return 0; px = nr; py = nc; return 1; } /* ---------- solver: recursion + backtracking ---------- */ int solveMaze(int r, int c) { if (isWall(r, c) || visited[r][c]) return 0; if (r == ex && c == ey) return 1; /* reached the exit */ visited[r][c] = 1; if (solveMaze(r - 1, c) || solveMaze(r + 1, c) || solveMaze(r, c - 1) || solveMaze(r, c + 1)) { if (maze[r][c] == ' ') maze[r][c] = '*'; /* part of the path */ return 1; } return 0; /* dead end: backtrack */ } /* ---------- one level ---------- */ /* returns 1 = won, 2 = solution shown (level skipped), 0 = quit */ int playLevel(int lvl) { int moves = 0, key; time_t startTime; generateLevel(lvl); checkTerminal(); startTime = time(NULL); while (1) { printMaze(lvl, moves); key = getKey(); if (key == EOF) return 0; key = tolower(key); if (key == 'q') return 0; if (key == 'h') { memset(visited, 0, sizeof(visited)); solveMaze(px, py); for (int i = 0; i < rows; i++) for (int j = 0; j < cols; j++) seen[i][j] = 1; radius = 0; hintsUsed++; printMaze(lvl, moves); printf("\nSolution shown with '*'. Press any key to continue..."); fflush(stdout); getKey(); return 2; } if (movePlayer(key)) { moves++; totalMoves++; updateSeen(); } if (px == ex && py == ey) { long t = (long)(time(NULL) - startTime); totalTime += t; printMaze(lvl, moves); printf("\nLEVEL %d COMPLETE! Moves: %d | Time: %ld sec\n", lvl, moves, t); return 1; } } } int main(int argc, char *argv[]) { int start = 1; int quit = 0; if (argc > 1) start = atoi(argv[1]); if (start < 1 || start > LEVELS) start = 1; srand(argc > 2 ? (unsigned)atoi(argv[2]) : (unsigned)time(NULL)); printf("\033[2J\033[H"); printf("=========== MAZE RUNNER ===========\n\n"); printf(" Reach the exit E from the start S.\n"); printf(" %d levels, every maze is new and random.\n", LEVELS); printf(" Levels get bigger and harder; from level %d fog hides the maze!\n\n", FOG_START); printf(" W/A/S/D = move H = show solution Q = quit\n\n"); printf(" Press any key to start..."); fflush(stdout); getKey(); for (int lvl = start; lvl <= LEVELS; lvl++) { int result = playLevel(lvl); if (result == 0) { quit = 1; break; } if (result == 1) levelsWon++; if (lvl < LEVELS) { if (result == 1) { printf("Press any key for the next level..."); fflush(stdout); getKey(); } } } printf("\033[2J\033[H"); printf("=========== GAME OVER ===========\n\n"); if (!quit && levelsWon + hintsUsed >= LEVELS - start + 1 && hintsUsed == 0) printf(" CONGRATULATIONS! You beat all levels without hints!\n\n"); printf(" Levels completed : %d\n", levelsWon); printf(" Total moves : %d\n", totalMoves); printf(" Total time : %ld sec\n", totalTime); printf(" Hints used : %d\n\n", hintsUsed); return 0; } create a 3d best game using this code

3D Maze Runner: harith's Escape Game

About this game

Comments

Game facts