Newer
Older
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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
#include <stdlib.h>
#include "path.h"
#include "dungeon.h"
#include "utils.h"
#include "pc.h"
/* Ugly hack: There is no way to pass a pointer to the dungeon into the *
* heap's comparitor funtion without modifying the heap. Copying the *
* pc_distance array is a possible solution, but that doubles the *
* bandwidth requirements for dijkstra, which would also be bad. *
* Instead, make a global pointer to the dungeon in this file, *
* initialize it in dijkstra, and use it in the comparitor to get to *
* pc_distance. Otherwise, pretend it doesn't exist, because it really *
* is ugly. */
static dungeon *thedungeon;
typedef struct path {
heap_node_t *hn;
uint8_t pos[2];
} path_t;
static int32_t dist_cmp(const void *key, const void *with) {
return ((int32_t) thedungeon->pc_distance[((path_t *) key)->pos[dim_y]]
[((path_t *) key)->pos[dim_x]] -
(int32_t) thedungeon->pc_distance[((path_t *) with)->pos[dim_y]]
[((path_t *) with)->pos[dim_x]]);
}
static int32_t tunnel_cmp(const void *key, const void *with) {
return ((int32_t) thedungeon->pc_tunnel[((path_t *) key)->pos[dim_y]]
[((path_t *) key)->pos[dim_x]] -
(int32_t) thedungeon->pc_tunnel[((path_t *) with)->pos[dim_y]]
[((path_t *) with)->pos[dim_x]]);
}
void dijkstra(dungeon *d)
{
/* Currently assumes that monsters only move on floors. Will *
* need to be modified for tunneling and pass-wall monsters. */
heap_t h;
uint32_t x, y;
static path_t p[DUNGEON_Y][DUNGEON_X], *c;
static uint32_t initialized = 0;
if (!initialized) {
initialized = 1;
thedungeon = d;
for (y = 0; y < DUNGEON_Y; y++) {
for (x = 0; x < DUNGEON_X; x++) {
p[y][x].pos[dim_y] = y;
p[y][x].pos[dim_x] = x;
}
}
}
for (y = 0; y < DUNGEON_Y; y++) {
for (x = 0; x < DUNGEON_X; x++) {
d->pc_distance[y][x] = 255;
}
}
d->pc_distance[d->PC->position[dim_y]][d->PC->position[dim_x]] = 0;
heap_init(&h, dist_cmp, NULL);
for (y = 0; y < DUNGEON_Y; y++) {
for (x = 0; x < DUNGEON_X; x++) {
if (mapxy(x, y) >= ter_floor) {
p[y][x].hn = heap_insert(&h, &p[y][x]);
}
}
}
while ((c = (path_t *) heap_remove_min(&h))) {
c->hn = NULL;
if ((p[c->pos[dim_y] - 1][c->pos[dim_x] - 1].hn) &&
(d->pc_distance[c->pos[dim_y] - 1][c->pos[dim_x] - 1] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] - 1][c->pos[dim_x] - 1] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] - 1][c->pos[dim_x] - 1].hn);
}
if ((p[c->pos[dim_y] - 1][c->pos[dim_x] ].hn) &&
(d->pc_distance[c->pos[dim_y] - 1][c->pos[dim_x] ] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] - 1][c->pos[dim_x] ] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] - 1][c->pos[dim_x] ].hn);
}
if ((p[c->pos[dim_y] - 1][c->pos[dim_x] + 1].hn) &&
(d->pc_distance[c->pos[dim_y] - 1][c->pos[dim_x] + 1] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] - 1][c->pos[dim_x] + 1] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] - 1][c->pos[dim_x] + 1].hn);
}
if ((p[c->pos[dim_y] ][c->pos[dim_x] - 1].hn) &&
(d->pc_distance[c->pos[dim_y] ][c->pos[dim_x] - 1] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] ][c->pos[dim_x] - 1] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] ][c->pos[dim_x] - 1].hn);
}
if ((p[c->pos[dim_y] ][c->pos[dim_x] + 1].hn) &&
(d->pc_distance[c->pos[dim_y] ][c->pos[dim_x] + 1] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] ][c->pos[dim_x] + 1] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] ][c->pos[dim_x] + 1].hn);
}
if ((p[c->pos[dim_y] + 1][c->pos[dim_x] - 1].hn) &&
(d->pc_distance[c->pos[dim_y] + 1][c->pos[dim_x] - 1] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] + 1][c->pos[dim_x] - 1] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] + 1][c->pos[dim_x] - 1].hn);
}
if ((p[c->pos[dim_y] + 1][c->pos[dim_x] ].hn) &&
(d->pc_distance[c->pos[dim_y] + 1][c->pos[dim_x] ] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] + 1][c->pos[dim_x] ] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] + 1][c->pos[dim_x] ].hn);
}
if ((p[c->pos[dim_y] + 1][c->pos[dim_x] + 1].hn) &&
(d->pc_distance[c->pos[dim_y] + 1][c->pos[dim_x] + 1] >
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1)) {
d->pc_distance[c->pos[dim_y] + 1][c->pos[dim_x] + 1] =
d->pc_distance[c->pos[dim_y]][c->pos[dim_x]] + 1;
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] + 1][c->pos[dim_x] + 1].hn);
}
}
heap_delete(&h);
}
/* Ignores the case of hardness == 255, because if *
* that gets here, there's already been an error. */
#define tunnel_movement_cost(x, y) \
((d->hardness[y][x] / 85) + 1)
void dijkstra_tunnel(dungeon *d)
{
/* Currently assumes that monsters only move on floors. Will *
* need to be modified for tunneling and pass-wall monsters. */
heap_t h;
uint32_t x, y;
uint32_t size;
static path_t p[DUNGEON_Y][DUNGEON_X], *c;
static uint32_t initialized = 0;
if (!initialized) {
initialized = 1;
thedungeon = d;
for (y = 0; y < DUNGEON_Y; y++) {
for (x = 0; x < DUNGEON_X; x++) {
p[y][x].pos[dim_y] = y;
p[y][x].pos[dim_x] = x;
}
}
}
for (y = 0; y < DUNGEON_Y; y++) {
for (x = 0; x < DUNGEON_X; x++) {
d->pc_tunnel[y][x] = 255;
}
}
d->pc_tunnel[d->PC->position[dim_y]][d->PC->position[dim_x]] = 0;
heap_init(&h, tunnel_cmp, NULL);
for (y = 0; y < DUNGEON_Y; y++) {
for (x = 0; x < DUNGEON_X; x++) {
if (mapxy(x, y) != ter_wall_immutable) {
p[y][x].hn = heap_insert(&h, &p[y][x]);
}
}
}
size = h.size;
while ((c = (path_t *) heap_remove_min(&h))) {
if (--size != h.size) {
exit(1);
}
c->hn = NULL;
if ((p[c->pos[dim_y] - 1][c->pos[dim_x] - 1].hn) &&
(d->pc_tunnel[c->pos[dim_y] - 1][c->pos[dim_x] - 1] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] - 1][c->pos[dim_x] - 1] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] - 1][c->pos[dim_x] - 1].hn);
}
if ((p[c->pos[dim_y] - 1][c->pos[dim_x] ].hn) &&
(d->pc_tunnel[c->pos[dim_y] - 1][c->pos[dim_x] ] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] - 1][c->pos[dim_x] ] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] - 1][c->pos[dim_x] ].hn);
}
if ((p[c->pos[dim_y] - 1][c->pos[dim_x] + 1].hn) &&
(d->pc_tunnel[c->pos[dim_y] - 1][c->pos[dim_x] + 1] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] - 1][c->pos[dim_x] + 1] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] - 1][c->pos[dim_x] + 1].hn);
}
if ((p[c->pos[dim_y] ][c->pos[dim_x] - 1].hn) &&
(d->pc_tunnel[c->pos[dim_y] ][c->pos[dim_x] - 1] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] ][c->pos[dim_x] - 1] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] ][c->pos[dim_x] - 1].hn);
}
if ((p[c->pos[dim_y] ][c->pos[dim_x] + 1].hn) &&
(d->pc_tunnel[c->pos[dim_y] ][c->pos[dim_x] + 1] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] ][c->pos[dim_x] + 1] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] ][c->pos[dim_x] + 1].hn);
}
if ((p[c->pos[dim_y] + 1][c->pos[dim_x] - 1].hn) &&
(d->pc_tunnel[c->pos[dim_y] + 1][c->pos[dim_x] - 1] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] + 1][c->pos[dim_x] - 1] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] + 1][c->pos[dim_x] - 1].hn);
}
if ((p[c->pos[dim_y] + 1][c->pos[dim_x] ].hn) &&
(d->pc_tunnel[c->pos[dim_y] + 1][c->pos[dim_x] ] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] + 1][c->pos[dim_x] ] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] + 1][c->pos[dim_x] ].hn);
}
if ((p[c->pos[dim_y] + 1][c->pos[dim_x] + 1].hn) &&
(d->pc_tunnel[c->pos[dim_y] + 1][c->pos[dim_x] + 1] >
d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]))) {
d->pc_tunnel[c->pos[dim_y] + 1][c->pos[dim_x] + 1] =
(d->pc_tunnel[c->pos[dim_y]][c->pos[dim_x]] +
tunnel_movement_cost(c->pos[dim_x], c->pos[dim_y]));
heap_decrease_key_no_replace(&h,
p[c->pos[dim_y] + 1][c->pos[dim_x] + 1].hn);
}
}
heap_delete(&h);
}