hack.vault.c revision 1.3 1 1.2 mycroft /*
2 1.2 mycroft * Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985.
3 1.2 mycroft */
4 1.2 mycroft
5 1.2 mycroft #ifndef lint
6 1.3 cgd static char rcsid[] = "$NetBSD: hack.vault.c,v 1.3 1995/03/23 08:31:59 cgd Exp $";
7 1.2 mycroft #endif /* not lint */
8 1.1 cgd
9 1.1 cgd #include "hack.h"
10 1.1 cgd #ifdef QUEST
11 1.1 cgd setgd(/* mtmp */) /* struct monst *mtmp; */ {}
12 1.1 cgd gd_move() { return(2); }
13 1.1 cgd gddead(mtmp) struct monst *mtmp; {}
14 1.1 cgd replgd(mtmp,mtmp2) struct monst *mtmp, *mtmp2; {}
15 1.1 cgd invault(){}
16 1.1 cgd
17 1.1 cgd #else
18 1.1 cgd
19 1.1 cgd
20 1.1 cgd #include "def.mkroom.h"
21 1.1 cgd extern struct monst *makemon();
22 1.1 cgd #define FCSIZ (ROWNO+COLNO)
23 1.1 cgd struct fakecorridor {
24 1.1 cgd xchar fx,fy,ftyp;
25 1.1 cgd };
26 1.1 cgd
27 1.1 cgd struct egd {
28 1.1 cgd int fcbeg, fcend; /* fcend: first unused pos */
29 1.1 cgd xchar gdx, gdy; /* goal of guard's walk */
30 1.1 cgd unsigned gddone:1;
31 1.1 cgd struct fakecorridor fakecorr[FCSIZ];
32 1.1 cgd };
33 1.1 cgd
34 1.1 cgd static struct permonst pm_guard =
35 1.1 cgd { "guard", '@', 12, 12, -1, 4, 10, sizeof(struct egd) };
36 1.1 cgd
37 1.1 cgd static struct monst *guard;
38 1.1 cgd static int gdlevel;
39 1.1 cgd #define EGD ((struct egd *)(&(guard->mextra[0])))
40 1.1 cgd
41 1.1 cgd static
42 1.1 cgd restfakecorr()
43 1.1 cgd {
44 1.1 cgd register fcx,fcy,fcbeg;
45 1.1 cgd register struct rm *crm;
46 1.1 cgd
47 1.1 cgd while((fcbeg = EGD->fcbeg) < EGD->fcend) {
48 1.1 cgd fcx = EGD->fakecorr[fcbeg].fx;
49 1.1 cgd fcy = EGD->fakecorr[fcbeg].fy;
50 1.1 cgd if((u.ux == fcx && u.uy == fcy) || cansee(fcx,fcy) ||
51 1.1 cgd m_at(fcx,fcy))
52 1.1 cgd return;
53 1.1 cgd crm = &levl[fcx][fcy];
54 1.1 cgd crm->typ = EGD->fakecorr[fcbeg].ftyp;
55 1.1 cgd if(!crm->typ) crm->seen = 0;
56 1.1 cgd newsym(fcx,fcy);
57 1.1 cgd EGD->fcbeg++;
58 1.1 cgd }
59 1.1 cgd /* it seems he left the corridor - let the guard disappear */
60 1.1 cgd mondead(guard);
61 1.1 cgd guard = 0;
62 1.1 cgd }
63 1.1 cgd
64 1.1 cgd static
65 1.1 cgd goldincorridor()
66 1.1 cgd {
67 1.1 cgd register int fci;
68 1.1 cgd
69 1.1 cgd for(fci = EGD->fcbeg; fci < EGD->fcend; fci++)
70 1.1 cgd if(g_at(EGD->fakecorr[fci].fx, EGD->fakecorr[fci].fy))
71 1.1 cgd return(1);
72 1.1 cgd return(0);
73 1.1 cgd }
74 1.1 cgd
75 1.1 cgd setgd(){
76 1.1 cgd register struct monst *mtmp;
77 1.1 cgd for(mtmp = fmon; mtmp; mtmp = mtmp->nmon) if(mtmp->isgd){
78 1.1 cgd guard = mtmp;
79 1.1 cgd gdlevel = dlevel;
80 1.1 cgd return;
81 1.1 cgd }
82 1.1 cgd guard = 0;
83 1.1 cgd }
84 1.1 cgd
85 1.1 cgd invault(){
86 1.1 cgd register tmp = inroom(u.ux, u.uy);
87 1.1 cgd if(tmp < 0 || rooms[tmp].rtype != VAULT) {
88 1.1 cgd u.uinvault = 0;
89 1.1 cgd return;
90 1.1 cgd }
91 1.1 cgd if(++u.uinvault % 50 == 0 && (!guard || gdlevel != dlevel)) {
92 1.1 cgd char buf[BUFSZ];
93 1.1 cgd register x,y,dd,gx,gy;
94 1.1 cgd
95 1.1 cgd /* first find the goal for the guard */
96 1.1 cgd for(dd = 1; (dd < ROWNO || dd < COLNO); dd++) {
97 1.1 cgd for(y = u.uy-dd; y <= u.uy+dd; y++) {
98 1.1 cgd if(y < 0 || y > ROWNO-1) continue;
99 1.1 cgd for(x = u.ux-dd; x <= u.ux+dd; x++) {
100 1.1 cgd if(y != u.uy-dd && y != u.uy+dd && x != u.ux-dd)
101 1.1 cgd x = u.ux+dd;
102 1.1 cgd if(x < 0 || x > COLNO-1) continue;
103 1.1 cgd if(levl[x][y].typ == CORR) goto fnd;
104 1.1 cgd }
105 1.1 cgd }
106 1.1 cgd }
107 1.1 cgd impossible("Not a single corridor on this level??");
108 1.1 cgd tele();
109 1.1 cgd return;
110 1.1 cgd fnd:
111 1.1 cgd gx = x; gy = y;
112 1.1 cgd
113 1.1 cgd /* next find a good place for a door in the wall */
114 1.1 cgd x = u.ux; y = u.uy;
115 1.1 cgd while(levl[x][y].typ == ROOM) {
116 1.1 cgd register int dx,dy;
117 1.1 cgd
118 1.1 cgd dx = (gx > x) ? 1 : (gx < x) ? -1 : 0;
119 1.1 cgd dy = (gy > y) ? 1 : (gy < y) ? -1 : 0;
120 1.1 cgd if(abs(gx-x) >= abs(gy-y))
121 1.1 cgd x += dx;
122 1.1 cgd else
123 1.1 cgd y += dy;
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd /* make something interesting happen */
127 1.1 cgd if(!(guard = makemon(&pm_guard,x,y))) return;
128 1.1 cgd guard->isgd = guard->mpeaceful = 1;
129 1.1 cgd EGD->gddone = 0;
130 1.1 cgd gdlevel = dlevel;
131 1.1 cgd if(!cansee(guard->mx, guard->my)) {
132 1.1 cgd mondead(guard);
133 1.1 cgd guard = 0;
134 1.1 cgd return;
135 1.1 cgd }
136 1.1 cgd
137 1.1 cgd pline("Suddenly one of the Vault's guards enters!");
138 1.1 cgd pmon(guard);
139 1.1 cgd do {
140 1.1 cgd pline("\"Hello stranger, who are you?\" - ");
141 1.1 cgd getlin(buf);
142 1.1 cgd } while (!letter(buf[0]));
143 1.1 cgd
144 1.1 cgd if(!strcmp(buf, "Croesus") || !strcmp(buf, "Kroisos")) {
145 1.1 cgd pline("\"Oh, yes - of course. Sorry to have disturbed you.\"");
146 1.1 cgd mondead(guard);
147 1.1 cgd guard = 0;
148 1.1 cgd return;
149 1.1 cgd }
150 1.1 cgd clrlin();
151 1.1 cgd pline("\"I don't know you.\"");
152 1.1 cgd if(!u.ugold)
153 1.1 cgd pline("\"Please follow me.\"");
154 1.1 cgd else {
155 1.1 cgd pline("\"Most likely all that gold was stolen from this vault.\"");
156 1.1 cgd pline("\"Please drop your gold (say d$ ) and follow me.\"");
157 1.1 cgd }
158 1.1 cgd EGD->gdx = gx;
159 1.1 cgd EGD->gdy = gy;
160 1.1 cgd EGD->fcbeg = 0;
161 1.1 cgd EGD->fakecorr[0].fx = x;
162 1.1 cgd EGD->fakecorr[0].fy = y;
163 1.1 cgd EGD->fakecorr[0].ftyp = levl[x][y].typ;
164 1.1 cgd levl[x][y].typ = DOOR;
165 1.1 cgd EGD->fcend = 1;
166 1.1 cgd }
167 1.1 cgd }
168 1.1 cgd
169 1.1 cgd gd_move(){
170 1.1 cgd register int x,y,dx,dy,gx,gy,nx,ny,typ;
171 1.1 cgd register struct fakecorridor *fcp;
172 1.1 cgd register struct rm *crm;
173 1.1 cgd if(!guard || gdlevel != dlevel){
174 1.1 cgd impossible("Where is the guard?");
175 1.1 cgd return(2); /* died */
176 1.1 cgd }
177 1.1 cgd if(u.ugold || goldincorridor())
178 1.1 cgd return(0); /* didnt move */
179 1.1 cgd if(dist(guard->mx,guard->my) > 1 || EGD->gddone) {
180 1.1 cgd restfakecorr();
181 1.1 cgd return(0); /* didnt move */
182 1.1 cgd }
183 1.1 cgd x = guard->mx;
184 1.1 cgd y = guard->my;
185 1.1 cgd /* look around (hor & vert only) for accessible places */
186 1.1 cgd for(nx = x-1; nx <= x+1; nx++) for(ny = y-1; ny <= y+1; ny++) {
187 1.1 cgd if(nx == x || ny == y) if(nx != x || ny != y)
188 1.1 cgd if(isok(nx,ny))
189 1.1 cgd if(!IS_WALL(typ = (crm = &levl[nx][ny])->typ) && typ != POOL) {
190 1.1 cgd register int i;
191 1.1 cgd for(i = EGD->fcbeg; i < EGD->fcend; i++)
192 1.1 cgd if(EGD->fakecorr[i].fx == nx &&
193 1.1 cgd EGD->fakecorr[i].fy == ny)
194 1.1 cgd goto nextnxy;
195 1.1 cgd if((i = inroom(nx,ny)) >= 0 && rooms[i].rtype == VAULT)
196 1.1 cgd goto nextnxy;
197 1.1 cgd /* seems we found a good place to leave him alone */
198 1.1 cgd EGD->gddone = 1;
199 1.1 cgd if(ACCESSIBLE(typ)) goto newpos;
200 1.1 cgd crm->typ = (typ == SCORR) ? CORR : DOOR;
201 1.1 cgd goto proceed;
202 1.1 cgd }
203 1.1 cgd nextnxy: ;
204 1.1 cgd }
205 1.1 cgd nx = x;
206 1.1 cgd ny = y;
207 1.1 cgd gx = EGD->gdx;
208 1.1 cgd gy = EGD->gdy;
209 1.1 cgd dx = (gx > x) ? 1 : (gx < x) ? -1 : 0;
210 1.1 cgd dy = (gy > y) ? 1 : (gy < y) ? -1 : 0;
211 1.1 cgd if(abs(gx-x) >= abs(gy-y)) nx += dx; else ny += dy;
212 1.1 cgd
213 1.1 cgd while((typ = (crm = &levl[nx][ny])->typ) != 0) {
214 1.1 cgd /* in view of the above we must have IS_WALL(typ) or typ == POOL */
215 1.1 cgd /* must be a wall here */
216 1.1 cgd if(isok(nx+nx-x,ny+ny-y) && typ != POOL &&
217 1.1 cgd ZAP_POS(levl[nx+nx-x][ny+ny-y].typ)){
218 1.1 cgd crm->typ = DOOR;
219 1.1 cgd goto proceed;
220 1.1 cgd }
221 1.1 cgd if(dy && nx != x) {
222 1.1 cgd nx = x; ny = y+dy;
223 1.1 cgd continue;
224 1.1 cgd }
225 1.1 cgd if(dx && ny != y) {
226 1.1 cgd ny = y; nx = x+dx; dy = 0;
227 1.1 cgd continue;
228 1.1 cgd }
229 1.1 cgd /* I don't like this, but ... */
230 1.1 cgd crm->typ = DOOR;
231 1.1 cgd goto proceed;
232 1.1 cgd }
233 1.1 cgd crm->typ = CORR;
234 1.1 cgd proceed:
235 1.1 cgd if(cansee(nx,ny)) {
236 1.1 cgd mnewsym(nx,ny);
237 1.1 cgd prl(nx,ny);
238 1.1 cgd }
239 1.1 cgd fcp = &(EGD->fakecorr[EGD->fcend]);
240 1.1 cgd if(EGD->fcend++ == FCSIZ) panic("fakecorr overflow");
241 1.1 cgd fcp->fx = nx;
242 1.1 cgd fcp->fy = ny;
243 1.1 cgd fcp->ftyp = typ;
244 1.1 cgd newpos:
245 1.1 cgd if(EGD->gddone) nx = ny = 0;
246 1.1 cgd guard->mx = nx;
247 1.1 cgd guard->my = ny;
248 1.1 cgd pmon(guard);
249 1.1 cgd restfakecorr();
250 1.1 cgd return(1);
251 1.1 cgd }
252 1.1 cgd
253 1.1 cgd gddead(){
254 1.1 cgd guard = 0;
255 1.1 cgd }
256 1.1 cgd
257 1.1 cgd replgd(mtmp,mtmp2)
258 1.1 cgd register struct monst *mtmp, *mtmp2;
259 1.1 cgd {
260 1.1 cgd if(mtmp == guard)
261 1.1 cgd guard = mtmp2;
262 1.1 cgd }
263 1.1 cgd
264 1.1 cgd #endif QUEST
265