1
void generate_maze_recursive(int x, int y) {
2
    maze[y][x] = PATH;
3

4
    int directions[4] = {0, 1, 2, 3};
5
    int dx[] = {0, 2, 0, -2};
6
    int dy[] = {-2, 0, 2, 0};
7

8
    for (int i = 0; i < 4; i++) {
9
        int j = rand() % 4;
10
        int temp = directions[i];
11
        directions[i] = directions[j];
12
        directions[j] = temp;
13
    }
14

15
    for (int i = 0; i < 4; i++) {
16
        int nx = x + dx[directions[i]];
17
        int ny = y + dy[directions[i]];
18

19
        if (is_valid(nx, ny) && maze[ny][nx] == WALL) {
20
            maze[y + dy[directions[i]] / 2][x + dx[directions[i]] / 2] = PATH;
21
            generate_maze_recursive(nx, ny);
22
        }
23
    }
24
}