2 * The author - Don Woods - apologises for the style of the code; it
3 * is a result of running the original Fortran IV source through a
4 * home-brew Fortran-to-C converter.)
17 long ABB[186], ATLOC[186], BLKLIN = true, DFLAG,
18 FIXED[NOBJECTS+1], HOLDNG,
19 LINK[NOBJECTS*2 + 1], LNLENG, LNPOSN,
20 PARMS[26], PLACE[NOBJECTS+1],
22 char rawbuf[LINESIZE], INLINE[LINESIZE+1], MAP1[129], MAP2[129];
24 long ABBNUM, AMBER, ATTACK, AXE, BACK, BATTER, BEAR, BIRD, BLOOD, BONUS,
25 BOTTLE, CAGE, CAVE, CAVITY, CHAIN, CHASM, CHEST, CHLOC, CHLOC2,
26 CLAM, CLOCK1, CLOCK2, CLOSED, CLOSNG, CLSHNT,
27 COINS, CONDS, DALTLC, DETAIL,
28 DKILL, DOOR, DPRSSN, DRAGON, DTOTAL, DWARF, EGGS,
29 EMRALD, ENTER, ENTRNC, FIND, FISSUR, FOOBAR, FOOD,
30 GRATE, HINT, HINTED[21], HINTLC[21],
31 I, INVENT, IGO, IWEST, J, JADE, K, K2, KEYS, KK,
32 KNFLOC, KNIFE, KQ, L, LAMP, LIMIT, LL,
33 LMWARN, LOC, LOCK, LOOK,
34 MAGZIN, MAXDIE, MAXTRS,
35 MESSAG, MIRROR, MXSCOR,
36 NEWLOC, NOVICE, NUGGET, NUL, NUMDIE, OBJ,
37 OGRE, OIL, OLDLC2, OLDLOC, OLDOBJ, OYSTER,
38 PANIC, PEARL, PILLOW, PLANT, PLANT2, PROP[NOBJECTS+1], PYRAM,
39 RESER, ROD, ROD2, RUBY, RUG, SAPPH, SAVED, SAY,
40 SCORE, SECT, SIGN, SNAKE, SPK, STEPS, STICK,
41 STREAM, TALLY, THRESH, THROW, TK[21], TRIDNT,
42 TRNDEX, TRNLUZ, TROLL, TROLL2,
43 TURNS, URN, V1, V2, VASE, VEND, VERB,
44 VOLCAN, VRSION = 25, WATER, WD1, WD1X, WD2, WD2X,
45 WZDARK = false, ZZWORD;
47 bool oldstyle = false;
50 extern void initialise();
51 extern void score(long);
52 extern int action(FILE *, long);
54 void sig_handler(int signo)
66 static bool do_command(FILE *);
68 int main(int argc, char *argv[]) {
71 /* Adventure (rev 2: 20 treasures) */
73 /* History: Original idea & 5-treasure version (adventures) by Willie Crowther
74 * 15-treasure version (adventure) by Don Woods, April-June 1977
75 * 20-treasure version (rev 2) by Don Woods, August 1978
76 * Errata fixed: 78/12/25 */
81 while ((ch = getopt(argc, argv, "l:o")) != EOF) {
84 logfp = fopen(optarg, "w");
87 "advent: can't open logfile %s for write\n",
89 signal(SIGINT, sig_handler);
99 * CLOSED says whether we're all the way closed
100 * CLOSNG says whether it's closing time yet
101 * CLSHNT says whether he's read the clue in the endgame
102 * LMWARN says whether he's been warned about lamp going dim
103 * NOVICE says whether he asked for instructions at start-up
104 * PANIC says whether he's found out he's trapped in the cave
105 * WZDARK says whether the loc he's leaving was dark */
109 /* Initialize our LCG PRNG with parameters tested against Knuth vol. 2. by the original authors */
113 lcgstate.m = 1048576;
115 long seedval = (long)rand();
118 /* Read the database if we have not yet done so */
121 if(!SETUP)initialise();
122 if(SETUP > 0) goto L1;
124 /* Unlike earlier versions, adventure is no longer restartable. (This
125 * lets us get away with modifying things such as OBJSND(BIRD) without
126 * having to be able to undo the changes later.) If a "used" copy is
127 * rerun, we come here and tell the player to run a fresh copy. */
132 /* Start-up, dwarf stuff */
137 NOVICE=YES(stdin, 65,1,0);
141 if(NOVICE)LIMIT=1000;
144 fprintf(logfp, "seed %ld\n", seedval);
147 if (!do_command(stdin))
153 static bool fallback_handler(char *buf)
154 /* fallback handler for commands not handled by FORTRANish parser */
157 if (sscanf(buf, "seed %ld", &sv) == 1) {
159 printf("Seed set to %ld\n", sv);
160 // autogenerated, so don't charge user time for it.
162 // here we reconfigure any global game state that uses random numbers
169 static bool do_command(FILE *cmdin) {
171 /* Can't leave cave once it's closing (except by main office). */
173 if(!OUTSID(NEWLOC) || NEWLOC == 0 || !CLOSNG) goto L71;
179 /* See if a dwarf has seen him and has come from where he wants to go. If so,
180 * the dwarf's blocking his way. If coming from place forbidden to pirate
181 * (dwarves rooted in place) let him get out (and attacked). */
183 L71: if(NEWLOC == LOC || FORCED(LOC) || CNDBIT(LOC,3)) goto L74;
184 /* 73 */ for (I=1; I<=NDWARVES-1; I++) {
185 if(game.odloc[I] != NEWLOC || !game.dseen[I]) goto L73;
193 /* Dwarf stuff. See earlier comments for description of variables. Remember
194 * sixth dwarf is pirate and is thus very different except for motion rules. */
196 /* First off, don't let the dwarves follow him into a pit or a wall. Activate
197 * the whole mess the first time he gets as far as the hall of mists (loc 15).
198 * If NEWLOC is forbidden to pirate (in particular, if it's beyond the troll
199 * bridge), bypass dwarf stuff. That way pirate can't steal return toll, and
200 * dwarves can't meet the bear. Also means dwarves won't follow him into dead
201 * end in maze, but c'est la vie. They'll wait for him outside the dead end. */
203 if(LOC == 0 || FORCED(LOC) || CNDBIT(NEWLOC,3)) goto L2000;
204 if(DFLAG != 0) goto L6000;
205 if(INDEEP(LOC))DFLAG=1;
208 /* When we encounter the first dwarf, we kill 0, 1, or 2 of the 5 dwarves. If
209 * any of the survivors is at loc, replace him with the alternate. */
211 L6000: if(DFLAG != 1) goto L6010;
212 if(!INDEEP(LOC) || (PCT(95) && (!CNDBIT(LOC,4) || PCT(85)))) goto L2000;
214 for (I=1; I<=2; I++) {
215 J=1+randrange(NDWARVES-1);
216 if(PCT(50))game.dloc[J]=0;
218 for (I=1; I<=NDWARVES-1; I++) {
219 if(game.dloc[I] == LOC)game.dloc[I]=DALTLC;
220 game.odloc[I]=game.dloc[I];
226 /* Things are in full swing. Move each dwarf at random, except if he's seen us
227 * he sticks with us. Dwarves stay deep inside. If wandering at random,
228 * they don't back up unless there's no alternative. If they don't have to
229 * move, they attack. And, of course, dead dwarves don't do much of anything. */
234 /* 6030 */ for (I=1; I<=NDWARVES; I++) {
235 if(game.dloc[I] == 0) goto L6030;
236 /* Fill TK array with all the places this dwarf might go. */
240 if(KK == 0) goto L6016;
241 L6012: NEWLOC=MOD(labs(TRAVEL[KK])/1000,1000);
243 if(NEWLOC > 300 || !INDEEP(NEWLOC) || NEWLOC == game.odloc[I] || (J > 1 &&
244 NEWLOC == TK[x]) || J >= 20 || NEWLOC == game.dloc[I] ||
245 FORCED(NEWLOC) || (I == 6 && CNDBIT(NEWLOC,3)) ||
246 labs(TRAVEL[KK])/1000000 == 100) goto L6014;}
250 {long x = KK-1; if(TRAVEL[x] >= 0) goto L6012;}
251 L6016: TK[J]=game.odloc[I];
254 game.odloc[I]=game.dloc[I];
256 game.dseen[I]=(game.dseen[I] && INDEEP(LOC)) || (game.dloc[I] == LOC || game.odloc[I] == LOC);
257 if(!game.dseen[I]) goto L6030;
259 if(I != 6) goto L6027;
261 /* The pirate's spotted him. He leaves him alone once we've found chest. K
262 * counts if a treasure is here. If not, and tally=1 for an unseen chest, let
263 * the pirate be spotted. Note that PLACE(CHEST)=0 might mean that he's
264 * thrown it to the troll, but in that case he's seen the chest (PROP=0). */
266 if(LOC == CHLOC || PROP[CHEST] >= 0) goto L6030;
268 /* 6020 */ for (J=50; J<=MAXTRS; J++) {
269 /* Pirate won't take pyramid from plover room or dark room (too easy!). */
270 if(J == PYRAM && (LOC == PLAC[PYRAM] || LOC == PLAC[EMRALD])) goto L6020;
271 if(TOTING(J)) goto L6021;
272 L6020: if(HERE(J))K=1;
274 if(TALLY == 1 && K == 0 && PLACE[CHEST] == 0 && HERE(LAMP) && PROP[LAMP]
276 if(game.odloc[6] != game.dloc[6] && PCT(20))RSPEAK(127);
279 L6021: if(PLACE[CHEST] != 0) goto L6022;
280 /* Install chest only once, to insure it is the last treasure in the list. */
284 /* 6023 */ for (J=50; J<=MAXTRS; J++) {
285 if(J == PYRAM && (LOC == PLAC[PYRAM] || LOC == PLAC[EMRALD])) goto L6023;
286 if(AT(J) && FIXED[J] == 0)CARRY(J,LOC);
287 if(TOTING(J))DROP(J,CHLOC);
290 L6024: game.dloc[6]=CHLOC;
300 /* This threatening little dwarf is in the room with him! */
302 L6027: DTOTAL=DTOTAL+1;
303 if(game.odloc[I] != game.dloc[I]) goto L6030;
305 if(KNFLOC >= 0)KNFLOC=LOC;
306 if(randrange(1000) < 95*(DFLAG-2))STICK=STICK+1;
310 /* Now we know what's happening. Let's tell the poor sucker about it.
311 * Note that various of the "knife" messages must have specific relative
312 * positions in the RSPEAK database. */
314 if(DTOTAL == 0) goto L2000;
317 if(ATTACK == 0) goto L2000;
318 if(DFLAG == 2)DFLAG=3;
324 RSPEAK(K+1+2/(1+STICK));
325 if(STICK == 0) goto L2000;
334 /* Describe the current location and (maybe) get next command. */
336 /* Print text for current loc. */
338 L2000: if(LOC == 0) goto L99;
340 if(MOD(ABB[LOC],ABBNUM) == 0 || KK == 0)KK=LTEXT[LOC];
341 if(FORCED(LOC) || !DARK(0)) goto L2001;
342 if(WZDARK && PCT(35)) goto L90;
344 L2001: if(TOTING(BEAR))RSPEAK(141);
347 if(FORCED(LOC)) goto L8;
348 if(LOC == 33 && PCT(25) && !CLOSNG)RSPEAK(7);
350 /* Print out descriptions of objects at this location. If not closing and
351 * property value is negative, tally off another treasure. Rug is special
352 * case; once seen, its PROP is 1 (dragon on it) till dragon is killed.
353 * Similarly for chain; PROP is initially 1 (locked to bear). These hacks
354 * are because PROP=0 is needed to get full score. */
356 if(DARK(0)) goto L2012;
359 L2004: if(I == 0) goto L2012;
361 if(OBJ > NOBJECTS)OBJ=OBJ-NOBJECTS;
362 if(OBJ == STEPS && TOTING(NUGGET)) goto L2008;
363 if(PROP[OBJ] >= 0) goto L2006;
364 if(CLOSED) goto L2008;
366 if(OBJ == RUG || OBJ == CHAIN)PROP[OBJ]=1;
368 /* Note: There used to be a test here to see whether the player had blown it
369 * so badly that he could never ever see the remaining treasures, and if so
370 * the lamp was zapped to 35 turns. But the tests were too simple-minded;
371 * things like killing the bird before the snake was gone (can never see
372 * jewelry), and doing it "right" was hopeless. E.G., could cross troll
373 * bridge several times, using up all available treasures, breaking vase,
374 * using coins to buy batteries, etc., and eventually never be able to get
375 * across again. If bottle were left on far side, could then never get eggs
376 * or trident, and the effects propagate. So the whole thing was flushed.
377 * anyone who makes such a gross blunder isn't likely to find everything
378 * else anyway (so goes the rationalisation). */
380 if(OBJ == STEPS && LOC == FIXED[STEPS])KK=1;
393 /* Check if this loc is eligible for any hints. If been here long enough,
394 * branch to help section (on later page). Hints all come back here eventually
395 * to finish the loop. Ignore "HINTS" < 4 (special stuff, see database notes).
398 L2600: if(COND[LOC] < CONDS) goto L2603;
399 /* 2602 */ for (HINT=1; HINT<=HNTMAX; HINT++) {
400 if(HINTED[HINT]) goto L2602;
401 if(!CNDBIT(LOC,HINT+10))HINTLC[HINT]= -1;
402 HINTLC[HINT]=HINTLC[HINT]+1;
403 if(HINTLC[HINT] >= HINTS[HINT][1]) goto L40000;
407 /* If closing time, check for any objects being toted with PROP < 0 and set
408 * the prop to -1-PROP. This way objects won't be described until they've
409 * been picked up and put down separate from their respective piles. Don't
410 * tick CLOCK1 unless well into cave (and not at Y2). */
412 L2603: if(!CLOSED) goto L2605;
413 if(PROP[OYSTER] < 0 && TOTING(OYSTER))PSPEAK(OYSTER,1);
414 for (I=1; I<=NOBJECTS; I++) {
415 if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I];
417 L2605: WZDARK=DARK(0);
418 if(KNFLOC > 0 && KNFLOC != LOC)KNFLOC=0;
420 if (!GETIN(cmdin, WD1,WD1X,WD2,WD2X))
423 /* Every input, check "FOOBAR" flag. If zero, nothing's going on. If pos,
424 * make neg. If neg, he skipped a word, so make it zero. */
426 L2607: FOOBAR=(FOOBAR>0 ? -FOOBAR : 0);
428 if(TURNS == THRESH) {
429 SPEAK(TTEXT[TRNDEX]);
430 TRNLUZ=TRNLUZ+TRNVAL[TRNDEX]/100000;
434 THRESH=MOD(TRNVAL[TRNDEX],100000)+1;
436 if(VERB == SAY && WD2 > 0)VERB=0;
437 if(VERB == SAY) goto L4090;
438 if(TALLY == 0 && INDEEP(LOC) && LOC != 33)CLOCK1=CLOCK1-1;
439 if(CLOCK1 == 0) goto L10000;
440 if(CLOCK1 < 0)CLOCK2=CLOCK2-1;
441 if(CLOCK2 == 0) goto L11000;
442 if(PROP[LAMP] == 1)LIMIT=LIMIT-1;
443 if(LIMIT <= 30 && HERE(BATTER) && PROP[BATTER] == 0 && HERE(LAMP)) goto
445 if(LIMIT == 0) goto L12400;
446 if(LIMIT <= 30) goto L12200;
448 if(LIQLOC(LOC) == WATER)K=70;
451 if(V1 == ENTER && (V2 == STREAM || V2 == 1000+WATER)) goto L2010;
452 if(V1 == ENTER && WD2 > 0) goto L2800;
453 if((V1 != 1000+WATER && V1 != 1000+OIL) || (V2 != 1000+PLANT && V2 !=
454 1000+DOOR)) goto L2610;
455 {long x = V2-1000; if(AT(x))WD2=MAKEWD(16152118);}
456 L2610: if(V1 == 1000+CAGE && V2 == 1000+BIRD && HERE(CAGE) && HERE(BIRD))
457 WD1=MAKEWD(301200308);
458 L2620: if(WD1 == MAKEWD(23051920)) {
460 if(IWEST == 10)RSPEAK(17);
462 if(WD1 != MAKEWD( 715) || WD2 == 0) goto L2630;
464 if(IGO == 10)RSPEAK(276);
465 L2630: I=VOCAB(WD1,-1);
466 if(I == -1) goto L3000;
469 switch (KQ-1) { case 0: goto L8; case 1: goto L5000; case 2: goto L4000;
470 case 3: goto L2010; }
473 /* Get second word for analysis. */
480 /* Gee, I don't understand. */
482 L3000: SETPRM(1,WD1,WD1X);
483 if (fallback_handler(rawbuf))
488 /* Verb and object analysis moved to separate module. */
490 L4000: I=4000; goto Laction;
491 L4090: I=4090; goto Laction;
494 switch (action(cmdin, I)) {
497 case 2000: goto L2000;
498 case 2009: goto L2009;
499 case 2010: goto L2010;
500 case 2011: goto L2011;
501 case 2012: goto L2012;
502 case 2600: goto L2600;
503 case 2607: goto L2607;
504 case 2630: goto L2630;
505 case 2800: goto L2800;
506 case 8000: goto L8000;
507 case 18999: goto L18999;
508 case 19000: goto L19000;
512 /* Random intransitive verbs come here. Clear obj just in case (see "attack").
515 L8000: SETPRM(1,WD1,WD1X);
520 /* Figure out the new location
522 * Given the current location in "LOC", and a motion verb number in "K", put
523 * the new location in "NEWLOC". The current loc is saved in "OLgame.dloc" in case
524 * he wants to retreat. The current OLgame.dloc is saved in OLDLC2, in case he
525 * dies. (if he does, NEWLOC will be limbo, and OLgame.dloc will be what killed
526 * him, so we need OLDLC2, which is the last place he was safe.) */
531 if(K == NUL) return true;
532 if(K == BACK) goto L20;
533 if(K == LOOK) goto L30;
534 if(K == CAVE) goto L40;
538 L9: LL=labs(TRAVEL[KK]);
539 if(MOD(LL,1000) == 1 || MOD(LL,1000) == K) goto L10;
540 if(TRAVEL[KK] < 0) goto L50;
546 K=MOD(NEWLOC,100); /* ESR: an instance of NOBJECTS? */
547 if(NEWLOC <= 300) goto L13;
548 if(PROP[K] != NEWLOC/100-3) goto L16;
549 L12: if(TRAVEL[KK] < 0)BUG(25);
551 NEWLOC=labs(TRAVEL[KK])/1000;
552 if(NEWLOC == LL) goto L12;
556 L13: if(NEWLOC <= 100) goto L14; /* ESR: an instance of NOBJECTS? */
557 if(TOTING(K) || (NEWLOC > 200 && AT(K))) goto L16;
560 L14: if(NEWLOC != 0 && !PCT(NEWLOC)) goto L12;
561 L16: NEWLOC=MOD(LL,1000);
562 if(NEWLOC <= 300) return true;
563 if(NEWLOC <= 500) goto L30000;
568 /* Special motions come here. Labelling convention: statement numbers NNNXX
569 * (XX=00-99) are used for special case number NNN (NNN=301-500). */
571 L30000: NEWLOC=NEWLOC-300;
572 switch (NEWLOC) { case 1: goto L30100; case 2: goto L30200; case 3: goto
576 /* Travel 301. Plover-alcove passage. Can carry only emerald. Note: travel
577 * table must include "useless" entries going through passage, which can never
578 * be used for actual motion, but can be spotted by "go back". */
580 L30100: NEWLOC=99+100-LOC; /* ESR: an instance of NOBJECTS? */
581 if(HOLDNG == 0 || (HOLDNG == 1 && TOTING(EMRALD))) return true;
586 /* Travel 302. Plover transport. Drop the emerald (only use special travel if
587 * toting it), so he's forced to use the plover-passage to get it out. Having
588 * dropped it, go back and pretend he wasn't carrying it after all. */
590 L30200: DROP(EMRALD,LOC);
593 /* Travel 303. Troll bridge. Must be done only as special motion so that
594 * dwarves won't wander across and encounter the bear. (They won't follow the
595 * player there because that region is forbidden to the pirate.) If
596 * PROP(TROLL)=1, he's crossed since paying, so step out and block him.
597 * (standard travel entries check for PROP(TROLL)=0.) Special stuff for bear. */
599 L30300: if(PROP[TROLL] != 1) goto L30310;
603 MOVE(TROLL2+NOBJECTS,0);
604 MOVE(TROLL,PLAC[TROLL]);
605 MOVE(TROLL+NOBJECTS,FIXD[TROLL]);
610 L30310: NEWLOC=PLAC[TROLL]+FIXD[TROLL]-LOC;
611 if(PROP[TROLL] == 0)PROP[TROLL]=1;
612 if(!TOTING(BEAR)) return true;
622 /* End of specials. */
624 /* Handle "go back". Look for verb which goes from LOC to OLDLOC, or to OLDLC2
625 * If OLDLOC has forced-motion. K2 saves entry -> forced loc -> previous loc. */
628 if(FORCED(K))K=OLDLC2;
633 if(CNDBIT(LOC,4))K2=274;
634 if(K2 == 0) goto L21;
638 L21: LL=MOD((labs(TRAVEL[KK])/1000),1000);
642 if(FORCED(LL) && MOD((labs(TRAVEL[J])/1000),1000) == K)
645 if(TRAVEL[KK] < 0) goto L23;
656 K=MOD(labs(TRAVEL[KK]),1000);
660 /* Look. Can't give more detail. Pretend it wasn't dark (though it may "now"
661 * be dark) so he won't fall into a pit while staring into the gloom. */
663 L30: if(DETAIL < 3)RSPEAK(15);
669 /* Cave. Different messages depending on whether above ground. */
672 if(OUTSID(LOC) && LOC != 8)K=57;
676 /* Non-applicable motion. Various messages depending on word given. */
679 if(K >= 43 && K <= 50)SPK=52;
680 if(K == 29 || K == 30)SPK=52;
681 if(K == 7 || K == 36 || K == 37)SPK=10;
682 if(K == 11 || K == 19)SPK=11;
683 if(VERB == FIND || VERB == INVENT)SPK=59;
684 if(K == 62 || K == 65)SPK=42;
689 /* "You're dead, Jim."
691 * If the current loc is zero, it means the clown got himself killed. We'll
692 * allow this maxdie times. MAXDIE is automatically set based on the number of
693 * snide messages available. Each death results in a message (81, 83, etc.)
694 * which offers reincarnation; if accepted, this results in message 82, 84,
695 * etc. The last time, if he wants another chance, he gets a snide remark as
696 * we exit. When reincarnated, all objects being carried get dropped at OLDLC2
697 * (presumably the last place prior to being killed) without change of props.
698 * the loop runs backwards to assure that the bird is dropped before the cage.
699 * (this kluge could be changed once we're sure all references to bird and cage
700 * are done by keywords.) The lamp is a special case (it wouldn't do to leave
701 * it in the cave). It is turned off and left outside the building (only if he
702 * was carrying it, of course). He himself is left inside the building (and
703 * heaven help him if he tries to xyzzy back into the cave without the lamp!).
704 * OLDLOC is zapped so he can't just "retreat". */
706 /* The easiest way to get killed is to fall into a pit in pitch darkness. */
711 /* Okay, he's dead. Let's get on with it. */
713 L99: if(CLOSNG) goto L95;
715 if(!YES(cmdin,79+NUMDIE*2,80+NUMDIE*2,54)) score(0);
716 if(NUMDIE == MAXDIE) score(0);
719 if(TOTING(LAMP))PROP[LAMP]=0;
720 /* 98 */ for (J=1; J<=NOBJECTS; J++) {
722 if(!TOTING(I)) goto L98;
732 /* He died during closing time. No resurrection. Tally up a death and exit. */
743 /* Come here if he's been long enough at required loc(s) for some unused hint.
744 * hint number is in variable "hint". Branch to quick test for additional
745 * conditions, then come back to do neat stuff. Goto 40010 if conditions are
746 * met and we want to offer the hint. Goto 40020 to clear HINTLC back to zero,
747 * 40030 to take no action yet. */
749 L40000: switch (HINT-1) { case 0: goto L40100; case 1: goto L40200; case 2: goto
750 L40300; case 3: goto L40400; case 4: goto L40500; case 5: goto
751 L40600; case 6: goto L40700; case 7: goto L40800; case 8: goto
752 L40900; case 9: goto L41000; }
753 /* CAVE BIRD SNAKE MAZE DARK WITT URN WOODS OGRE
757 L40010: HINTLC[HINT]=0;
758 if(!YES(cmdin,HINTS[HINT][3],0,54)) goto L2602;
759 SETPRM(1,HINTS[HINT][2],HINTS[HINT][2]);
761 HINTED[HINT]=YES(cmdin,175,HINTS[HINT][4],54);
762 if(HINTED[HINT] && LIMIT > 30)LIMIT=LIMIT+30*HINTS[HINT][2];
763 L40020: HINTLC[HINT]=0;
766 /* Now for the quick tests. See database description for one-line notes. */
768 L40100: if(PROP[GRATE] == 0 && !HERE(KEYS)) goto L40010;
771 L40200: if(PLACE[BIRD] == LOC && TOTING(ROD) && OLDOBJ == BIRD) goto L40010;
774 L40300: if(HERE(SNAKE) && !HERE(BIRD)) goto L40010;
777 L40400: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0 && HOLDNG >
781 L40500: if(PROP[EMRALD] != -1 && PROP[PYRAM] == -1) goto L40010;
786 L40700: if(DFLAG == 0) goto L40010;
789 L40800: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0) goto
793 L40900: I=ATDWRF(LOC);
794 if(I < 0) goto L40020;
795 if(HERE(OGRE) && I == 0) goto L40010;
798 L41000: if(TALLY == 1 && PROP[JADE] < 0) goto L40010;
805 /* Cave closing and scoring */
808 /* These sections handle the closing of the cave. The cave closes "clock1"
809 * turns after the last treasure has been located (including the pirate's
810 * chest, which may of course never show up). Note that the treasures need not
811 * have been taken yet, just located. Hence clock1 must be large enough to get
812 * out of the cave (it only ticks while inside the cave). When it hits zero,
813 * we branch to 10000 to start closing the cave, and then sit back and wait for
814 * him to try to get out. If he doesn't within clock2 turns, we close the
815 * cave; if he does try, we assume he panics, and give him a few additional
816 * turns to get frantic before we close. When clock2 hits zero, we branch to
817 * 11000 to transport him into the final puzzle. Note that the puzzle depends
818 * upon all sorts of random things. For instance, there must be no water or
819 * oil, since there are beanstalks which we don't want to be able to water,
820 * since the code can't handle it. Also, we can have no keys, since there is a
821 * grate (having moved the fixed object!) there separating him from all the
822 * treasures. Most of these problems arise from the use of negative prop
823 * numbers to suppress the object descriptions until he's actually moved the
826 /* When the first warning comes, we lock the grate, destroy the bridge, kill
827 * all the dwarves (and the pirate), remove the troll and bear (unless dead),
828 * and set "closng" to true. Leave the dragon; too much trouble to move it.
829 * from now until clock2 runs out, he cannot unlock the grate, move to any
830 * location outside the cave, or create the bridge. Nor can he be
831 * resurrected if he dies. Note that the snake is already gone, since he got
832 * to the treasure accessible only via the hall of the mountain king. Also, he's
833 * been in giant room (to get eggs), so we can refer to it. Also also, he's
834 * gotten the pearl, so we know the bivalve is an oyster. *And*, the dwarves
835 * must have been activated, since we've found chest. */
837 L10000: PROP[GRATE]=0;
839 for (I=1; I<=NDWARVES; I++) {
844 MOVE(TROLL+NOBJECTS,0);
845 MOVE(TROLL2,PLAC[TROLL]);
846 MOVE(TROLL2+NOBJECTS,FIXD[TROLL]);
848 if(PROP[BEAR] != 3)DSTROY(BEAR);
858 /* Once he's panicked, and clock2 has run out, we come here to set up the
859 * storage room. The room has two locs, hardwired as 115 (ne) and 116 (sw).
860 * At the ne end, we place empty bottles, a nursery of plants, a bed of
861 * oysters, a pile of lamps, rods with stars, sleeping dwarves, and him. At
862 * the sw end we place grate over treasures, snake pit, covey of caged birds,
863 * more rods, and pillows. A mirror stretches across one wall. Many of the
864 * objects come from known locations and/or states (e.g. the snake is known to
865 * have been destroyed and needn't be carried away from its old "place"),
866 * making the various objects be handled differently. We also drop all other
867 * objects he might be carrying (lest he have some which could cause trouble,
868 * such as the keys). We describe the flash of light and trundle back. */
870 L11000: PROP[BOTTLE]=PUT(BOTTLE,115,1);
871 PROP[PLANT]=PUT(PLANT,115,0);
872 PROP[OYSTER]=PUT(OYSTER,115,0);
874 PROP[LAMP]=PUT(LAMP,115,0);
875 PROP[ROD]=PUT(ROD,115,0);
876 PROP[DWARF]=PUT(DWARF,115,0);
881 /* Leave the grate with normal (non-negative) property. Reuse sign. */
885 OBJTXT[SIGN]=OBJTXT[SIGN]+1;
886 PROP[SNAKE]=PUT(SNAKE,116,1);
887 PROP[BIRD]=PUT(BIRD,116,1);
888 PROP[CAGE]=PUT(CAGE,116,0);
889 PROP[ROD2]=PUT(ROD2,116,0);
890 PROP[PILLOW]=PUT(PILLOW,116,0);
892 PROP[MIRROR]=PUT(MIRROR,115,0);
895 for (I=1; I<=NOBJECTS; I++) {
904 /* Another way we can force an end to things is by having the lamp give out.
905 * When it gets close, we come here to warn him. We go to 12000 if the lamp
906 * and fresh batteries are here, in which case we replace the batteries and
907 * continue. 12200 is for other cases of lamp dying. 12400 is when it goes
908 * out. Even then, he can explore outside for a while if desired. */
912 if(TOTING(BATTER))DROP(BATTER,LOC);
917 L12200: if(LMWARN || !HERE(LAMP)) goto L19999;
920 if(PLACE[BATTER] == 0)SPK=183;
921 if(PROP[BATTER] == 1)SPK=189;
927 if(HERE(LAMP))RSPEAK(184);
930 /* Oh dear, he's disturbed the dwarves. */