1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
/*
This program makes 10x10 mazes and prints them on the screen. No
promise of portability is made, but it does seem to work on NS GNX
C.
Public Domain by Jonathan Guthrie.
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define UP 1
#define DN 2
#define LT 4
#define RT 8
int addelem(int, int [12][12], int *, int, int);
void openwall(int [12][12], int, int);
void writemaze(int [12][12]);
void main(void)
{
int i, j, base;
int search[150], array[12][12];
for(i=1 ; i<11 ; ++i)
{
array[i][0] = -1;
array[i][11] = -1;
array[0][i] = -1;
array[11][i] = -1;
for(j=1 ; j<11 ; ++j)
array[i][j] = 0;
}
srand((int)time(NULL));
i = rand() % 10 + 1;
j = rand() % 10 + 1;
base = addelem(0, array, search, i, j);
array[i][j] = RT + RT; /* Not a valid value */
while(0 < base)
{
i = rand() % base;
j = search[i];
search[i] = search[--base];
i = j % 100;
j /= 100;
openwall(array, i, j);
base = addelem(base, array, search, i, j);
}
writemaze(array);
}
int addelem(int base, int maze[12][12], int *search, int row, int col)
{
if(0 == maze[row-1][col])
{
search[base++] = row + col * 100 - 1;
maze[row-1][col] = -DN;
}
else if(0 > maze[row-1][col])
maze[row-1][col] -= DN;
if(0 == maze[row+1][col])
{
search[base++] = row + col * 100 + 1;
maze[row+1][col] = -UP;
}
else if(0 > maze[row+1][col])
maze[row+1][col] -= UP;
if(0 == maze[row][col-1])
{
search[base++] = row + col * 100 - 100;
maze[row][col-1] = -RT;
}
else if(0 > maze[row][col-1])
maze[row][col-1] -= RT;
if(0 == maze[row][col+1])
{
search[base++] = row + col * 100 + 100;
maze[row][col+1] = -LT;
}
else if(0 > maze[row][col+1])
maze[row][col+1] -= LT;
return base;
}
void openwall(int maze[12][12], int row, int col)
{
int directions, max, direction, temprow, tempcol, temp, back;
directions = -maze[row][col];
max = 0;
if(directions & UP)
{
temp = rand();
if(temp > max)
{
max = temp;
direction = UP;
back = DN;
temprow = row - 1;
tempcol = col;
}
}
if(directions & DN)
{
temp = rand();
if(temp > max)
{
max = temp;
direction = DN;
back = UP;
temprow = row + 1;
tempcol = col;
}
}
if(directions & LT)
{
temp = rand();
if(temp > max)
{
max = temp;
direction = LT;
back = RT;
temprow = row;
tempcol = col - 1;
}
}
if(directions & RT)
{
temp = rand();
if(temp > max)
{
max = temp;
direction = RT;
back = LT;
temprow = row;
tempcol = col + 1;
}
}
maze[row][col] = direction;
maze[temprow][tempcol] += back;
}
void writemaze(int maze[12][12])
{
int i, j;
puts("*********************");
for(i=1 ; i<11 ; ++i)
{
putchar('*');
for(j=1 ; j<11 ; ++j)
{
putchar(' ');
if(maze[i][j] & RT)
putchar(' ');
else putchar('*');
}
putchar('\n');
for(j=1 ; j<11 ; ++j)
{
putchar('*');
if(maze[i][j] & DN)
putchar(' ');
else putchar('*');
}
puts("*");
}
}
|
