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.)
14 long ABB[186], ATAB[331], ATLOC[186], BLKLIN = true, DFLAG,
15 DLOC[7], FIXED[101], HOLDNG,
16 KTAB[331], *LINES, LINK[201], LNLENG, LNPOSN,
17 PARMS[26], PLACE[101], PTEXT[101], RTEXT[278],
18 SETUP = 0, TABSIZ = 330;
19 signed char INLINE[LINESIZE+1], MAP1[129], MAP2[129];
21 long ABBNUM, ACTSPK[36], AMBER, ATTACK, AXE, BACK, BATTER, BEAR, BIRD, BLOOD, BONUS,
22 BOTTLE, CAGE, CAVE, CAVITY, CHAIN, CHASM, CHEST, CHLOC, CHLOC2,
23 CLAM, CLOCK1, CLOCK2, CLOSED, CLOSNG, CLSHNT, CLSMAX = 12, CLSSES,
24 COINS, COND[186], CONDS, CTEXT[13], CVAL[13], DALTLC, DETAIL,
25 DKILL, DOOR, DPRSSN, DRAGON, DSEEN[7], DTOTAL, DWARF, EGGS,
26 EMRALD, ENTER, ENTRNC, FIND, FISSUR, FIXD[101], FOOBAR, FOOD,
27 GRATE, HINT, HINTED[21], HINTLC[21], HINTS[21][5], HNTMAX,
28 HNTSIZ = 20, I, INVENT, IGO, IWEST, J, JADE, K, K2, KEY[186], KEYS, KK,
29 KNFLOC, KNIFE, KQ, L, LAMP, LIMIT, LINSIZ = 12500, LINUSE, LL,
30 LMWARN, LOC, LOCK, LOCSIZ = 185, LOCSND[186], LOOK, LTEXT[186],
31 MAGZIN, MAXDIE, MAXTRS, MESH = 123456789,
32 MESSAG, MIRROR, MXSCOR,
33 NEWLOC, NOVICE, NUGGET, NUL, NUMDIE, OBJ, OBJSND[101],
34 OBJTXT[101], ODLOC[7], OGRE, OIL, OLDLC2, OLDLOC, OLDOBJ, OYSTER,
35 PANIC, PEARL, PILLOW, PLAC[101], PLANT, PLANT2, PROP[101], PYRAM,
36 RESER, ROD, ROD2, RTXSIZ = 277, RUBY, RUG, SAPPH, SAVED, SAY,
37 SCORE, SECT, SIGN, SNAKE, SPK, STEPS, STEXT[186], STICK,
38 STREAM, TABNDX, TALLY, THRESH, THROW, TK[21], TRAVEL[886], TRIDNT,
39 TRNDEX, TRNLUZ, TRNSIZ = 5, TRNVAL[6], TRNVLS, TROLL, TROLL2, TRVS,
40 TRVSIZ = 885, TTEXT[6], TURNS, URN, V1, V2, VASE, VEND, VERB,
41 VOLCAN, VRBSIZ = 35, VRSION = 25, WATER, WD1, WD1X, WD2, WD2X,
42 WZDARK = false, ZZWORD;
44 bool oldstyle = false;
47 extern void initialise();
48 extern void score(long);
49 extern int action(FILE *, long);
55 static void do_command(FILE *);
57 int main(int argc, char *argv[]) {
60 /* Adventure (rev 2: 20 treasures) */
62 /* History: Original idea & 5-treasure version (adventures) by Willie Crowther
63 * 15-treasure version (adventure) by Don Woods, April-June 1977
64 * 20-treasure version (rev 2) by Don Woods, August 1978
65 * Errata fixed: 78/12/25 */
70 while ((ch = getopt(argc, argv, "l:o")) != EOF) {
73 logfp = fopen(optarg, "w+");
76 "advent: can't open logfile %s for write\n",
87 * CLOSED says whether we're all the way closed
88 * CLOSNG says whether it's closing time yet
89 * CLSHNT says whether he's read the clue in the endgame
90 * LMWARN says whether he's been warned about lamp going dim
91 * NOVICE says whether he asked for instructions at start-up
92 * PANIC says whether he's found out he's trapped in the cave
93 * WZDARK says whether the loc he's leaving was dark */
97 /* Initialize our LCG PRNG with parameters tested against Knuth vol. 2. by the original authors */
101 lcgstate.m = 1048576;
102 set_seed_from_time();
104 /* Read the database if we have not yet done so */
106 LINES = (long *)calloc(LINSIZ+1,sizeof(long));
108 printf("Not enough memory!\n");
113 if(!SETUP)initialise();
114 if(SETUP > 0) goto L1;
116 /* Unlike earlier versions, adventure is no longer restartable. (This
117 * lets us get away with modifying things such as OBJSND(BIRD) without
118 * having to be able to undo the changes later.) If a "used" copy is
119 * rerun, we come here and tell the player to run a fresh copy. */
124 /* Start-up, dwarf stuff */
128 ZZWORD=RNDVOC(3,0)+MESH*2;
129 NOVICE=YES(stdin, 65,1,0);
133 if(NOVICE)LIMIT=1000;
140 static void do_command(FILE *cmdin) {
142 /* Can't leave cave once it's closing (except by main office). */
144 L2: if(!OUTSID(NEWLOC) || NEWLOC == 0 || !CLOSNG) goto L71;
150 /* See if a dwarf has seen him and has come from where he wants to go. If so,
151 * the dwarf's blocking his way. If coming from place forbidden to pirate
152 * (dwarves rooted in place) let him get out (and attacked). */
154 L71: if(NEWLOC == LOC || FORCED(LOC) || CNDBIT(LOC,3)) goto L74;
155 /* 73 */ for (I=1; I<=5; I++) {
156 if(ODLOC[I] != NEWLOC || !DSEEN[I]) goto L73;
164 /* Dwarf stuff. See earlier comments for description of variables. Remember
165 * sixth dwarf is pirate and is thus very different except for motion rules. */
167 /* First off, don't let the dwarves follow him into a pit or a wall. Activate
168 * the whole mess the first time he gets as far as the hall of mists (loc 15).
169 * If NEWLOC is forbidden to pirate (in particular, if it's beyond the troll
170 * bridge), bypass dwarf stuff. That way pirate can't steal return toll, and
171 * dwarves can't meet the bear. Also means dwarves won't follow him into dead
172 * end in maze, but c'est la vie. They'll wait for him outside the dead end. */
174 if(LOC == 0 || FORCED(LOC) || CNDBIT(NEWLOC,3)) goto L2000;
175 if(DFLAG != 0) goto L6000;
176 if(INDEEP(LOC))DFLAG=1;
179 /* When we encounter the first dwarf, we kill 0, 1, or 2 of the 5 dwarves. If
180 * any of the survivors is at loc, replace him with the alternate. */
182 L6000: if(DFLAG != 1) goto L6010;
183 if(!INDEEP(LOC) || (PCT(95) && (!CNDBIT(LOC,4) || PCT(85)))) goto L2000;
185 for (I=1; I<=2; I++) {
187 if(PCT(50))DLOC[J]=0;
189 for (I=1; I<=5; I++) {
190 if(DLOC[I] == LOC)DLOC[I]=DALTLC;
197 /* Things are in full swing. Move each dwarf at random, except if he's seen us
198 * he sticks with us. Dwarves stay deep inside. If wandering at random,
199 * they don't back up unless there's no alternative. If they don't have to
200 * move, they attack. And, of course, dead dwarves don't do much of anything. */
205 /* 6030 */ for (I=1; I<=6; I++) {
206 if(DLOC[I] == 0) goto L6030;
207 /* Fill TK array with all the places this dwarf might go. */
211 if(KK == 0) goto L6016;
212 L6012: NEWLOC=MOD(IABS(TRAVEL[KK])/1000,1000);
214 if(NEWLOC > 300 || !INDEEP(NEWLOC) || NEWLOC == ODLOC[I] || (J > 1 &&
215 NEWLOC == TK[x]) || J >= 20 || NEWLOC == DLOC[I] ||
216 FORCED(NEWLOC) || (I == 6 && CNDBIT(NEWLOC,3)) ||
217 IABS(TRAVEL[KK])/1000000 == 100) goto L6014;}
221 {long x = KK-1; if(TRAVEL[x] >= 0) goto L6012;}
222 L6016: TK[J]=ODLOC[I];
227 DSEEN[I]=(DSEEN[I] && INDEEP(LOC)) || (DLOC[I] == LOC || ODLOC[I] == LOC);
228 if(!DSEEN[I]) goto L6030;
230 if(I != 6) goto L6027;
232 /* The pirate's spotted him. He leaves him alone once we've found chest. K
233 * counts if a treasure is here. If not, and tally=1 for an unseen chest, let
234 * the pirate be spotted. Note that PLACE(CHEST)=0 might mean that he's
235 * thrown it to the troll, but in that case he's seen the chest (PROP=0). */
237 if(LOC == CHLOC || PROP[CHEST] >= 0) goto L6030;
239 /* 6020 */ for (J=50; J<=MAXTRS; J++) {
240 /* Pirate won't take pyramid from plover room or dark room (too easy!). */
241 if(J == PYRAM && (LOC == PLAC[PYRAM] || LOC == PLAC[EMRALD])) goto L6020;
242 if(TOTING(J)) goto L6021;
243 L6020: if(HERE(J))K=1;
245 if(TALLY == 1 && K == 0 && PLACE[CHEST] == 0 && HERE(LAMP) && PROP[LAMP]
247 if(ODLOC[6] != DLOC[6] && PCT(20))RSPEAK(127);
250 L6021: if(PLACE[CHEST] != 0) goto L6022;
251 /* Install chest only once, to insure it is the last treasure in the list. */
255 /* 6023 */ for (J=50; J<=MAXTRS; J++) {
256 if(J == PYRAM && (LOC == PLAC[PYRAM] || LOC == PLAC[EMRALD])) goto L6023;
257 if(AT(J) && FIXED[J] == 0)CARRY(J,LOC);
258 if(TOTING(J))DROP(J,CHLOC);
261 L6024: DLOC[6]=CHLOC;
271 /* This threatening little dwarf is in the room with him! */
273 L6027: DTOTAL=DTOTAL+1;
274 if(ODLOC[I] != DLOC[I]) goto L6030;
276 if(KNFLOC >= 0)KNFLOC=LOC;
277 if(randrange(1000) < 95*(DFLAG-2))STICK=STICK+1;
281 /* Now we know what's happening. Let's tell the poor sucker about it.
282 * Note that various of the "knife" messages must have specific relative
283 * positions in the RSPEAK database. */
285 if(DTOTAL == 0) goto L2000;
288 if(ATTACK == 0) goto L2000;
289 if(DFLAG == 2)DFLAG=3;
295 RSPEAK(K+1+2/(1+STICK));
296 if(STICK == 0) goto L2000;
305 /* Describe the current location and (maybe) get next command. */
307 /* Print text for current loc. */
309 L2000: if(LOC == 0) goto L99;
311 if(MOD(ABB[LOC],ABBNUM) == 0 || KK == 0)KK=LTEXT[LOC];
312 if(FORCED(LOC) || !DARK(0)) goto L2001;
313 if(WZDARK && PCT(35)) goto L90;
315 L2001: if(TOTING(BEAR))RSPEAK(141);
318 if(FORCED(LOC)) goto L8;
319 if(LOC == 33 && PCT(25) && !CLOSNG)RSPEAK(7);
321 /* Print out descriptions of objects at this location. If not closing and
322 * property value is negative, tally off another treasure. Rug is special
323 * case; once seen, its PROP is 1 (dragon on it) till dragon is killed.
324 * Similarly for chain; PROP is initially 1 (locked to bear). These hacks
325 * are because PROP=0 is needed to get full score. */
327 if(DARK(0)) goto L2012;
330 L2004: if(I == 0) goto L2012;
332 if(OBJ > 100)OBJ=OBJ-100;
333 if(OBJ == STEPS && TOTING(NUGGET)) goto L2008;
334 if(PROP[OBJ] >= 0) goto L2006;
335 if(CLOSED) goto L2008;
337 if(OBJ == RUG || OBJ == CHAIN)PROP[OBJ]=1;
339 /* Note: There used to be a test here to see whether the player had blown it
340 * so badly that he could never ever see the remaining treasures, and if so
341 * the lamp was zapped to 35 turns. But the tests were too simple-minded;
342 * things like killing the bird before the snake was gone (can never see
343 * jewelry), and doing it "right" was hopeless. E.G., could cross troll
344 * bridge several times, using up all available treasures, breaking vase,
345 * using coins to buy batteries, etc., and eventually never be able to get
346 * across again. If bottle were left on far side, could then never get eggs
347 * or trident, and the effects propagate. So the whole thing was flushed.
348 * anyone who makes such a gross blunder isn't likely to find everything
349 * else anyway (so goes the rationalisation). */
351 if(OBJ == STEPS && LOC == FIXED[STEPS])KK=1;
364 /* Check if this loc is eligible for any hints. If been here long enough,
365 * branch to help section (on later page). Hints all come back here eventually
366 * to finish the loop. Ignore "HINTS" < 4 (special stuff, see database notes).
369 L2600: if(COND[LOC] < CONDS) goto L2603;
370 /* 2602 */ for (HINT=1; HINT<=HNTMAX; HINT++) {
371 if(HINTED[HINT]) goto L2602;
372 if(!CNDBIT(LOC,HINT+10))HINTLC[HINT]= -1;
373 HINTLC[HINT]=HINTLC[HINT]+1;
374 if(HINTLC[HINT] >= HINTS[HINT][1]) goto L40000;
378 /* Kick the random number generator just to add variety to the chase. Also,
379 * if closing time, check for any objects being toted with PROP < 0 and set
380 * the prop to -1-PROP. This way objects won't be described until they've
381 * been picked up and put down separate from their respective piles. Don't
382 * tick CLOCK1 unless well into cave (and not at Y2). */
384 L2603: if(!CLOSED) goto L2605;
385 if(PROP[OYSTER] < 0 && TOTING(OYSTER))PSPEAK(OYSTER,1);
386 for (I=1; I<=100; I++) {
387 if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I];
389 L2605: WZDARK=DARK(0);
390 if(KNFLOC > 0 && KNFLOC != LOC)KNFLOC=0;
392 GETIN(cmdin, WD1,WD1X,WD2,WD2X);
394 /* Every input, check "FOOBAR" flag. If zero, nothing's going on. If pos,
395 * make neg. If neg, he skipped a word, so make it zero. */
397 L2607: FOOBAR=(FOOBAR>0 ? -FOOBAR : 0);
399 if(TURNS != THRESH) goto L2608;
400 SPEAK(TTEXT[TRNDEX]);
401 TRNLUZ=TRNLUZ+TRNVAL[TRNDEX]/100000;
404 if(TRNDEX <= TRNVLS)THRESH=MOD(TRNVAL[TRNDEX],100000)+1;
405 L2608: if(VERB == SAY && WD2 > 0)VERB=0;
406 if(VERB == SAY) goto L4090;
407 if(TALLY == 0 && INDEEP(LOC) && LOC != 33)CLOCK1=CLOCK1-1;
408 if(CLOCK1 == 0) goto L10000;
409 if(CLOCK1 < 0)CLOCK2=CLOCK2-1;
410 if(CLOCK2 == 0) goto L11000;
411 if(PROP[LAMP] == 1)LIMIT=LIMIT-1;
412 if(LIMIT <= 30 && HERE(BATTER) && PROP[BATTER] == 0 && HERE(LAMP)) goto
414 if(LIMIT == 0) goto L12400;
415 if(LIMIT <= 30) goto L12200;
417 if(LIQLOC(LOC) == WATER)K=70;
420 if(V1 == ENTER && (V2 == STREAM || V2 == 1000+WATER)) goto L2010;
421 if(V1 == ENTER && WD2 > 0) goto L2800;
422 if((V1 != 1000+WATER && V1 != 1000+OIL) || (V2 != 1000+PLANT && V2 !=
423 1000+DOOR)) goto L2610;
424 {long x = V2-1000; if(AT(x))WD2=MAKEWD(16152118);}
425 L2610: if(V1 == 1000+CAGE && V2 == 1000+BIRD && HERE(CAGE) &&
426 HERE(BIRD))WD1=MAKEWD(301200308);
427 L2620: if(WD1 != MAKEWD(23051920)) goto L2625;
429 if(IWEST == 10)RSPEAK(17);
430 L2625: if(WD1 != MAKEWD( 715) || WD2 == 0) goto L2630;
432 if(IGO == 10)RSPEAK(276);
433 L2630: I=VOCAB(WD1,-1);
434 if(I == -1) goto L3000;
437 switch (KQ-1) { case 0: goto L8; case 1: goto L5000; case 2: goto L4000;
438 case 3: goto L2010; }
441 /* Get second word for analysis. */
448 /* Gee, I don't understand. */
450 L3000: SETPRM(1,WD1,WD1X);
454 /* Verb and object analysis moved to separate module. */
456 L4000: I=4000; goto Laction;
457 L4090: I=4090; goto Laction;
460 switch (action(cmdin, I)) {
463 case 2000: goto L2000;
464 case 2009: goto L2009;
465 case 2010: goto L2010;
466 case 2011: goto L2011;
467 case 2012: goto L2012;
468 case 2600: goto L2600;
469 case 2607: goto L2607;
470 case 2630: goto L2630;
471 case 2800: goto L2800;
472 case 8000: goto L8000;
473 case 18999: goto L18999;
474 case 19000: goto L19000;
478 /* Random intransitive verbs come here. Clear obj just in case (see "attack").
481 L8000: SETPRM(1,WD1,WD1X);
486 /* Figure out the new location
488 * Given the current location in "LOC", and a motion verb number in "K", put
489 * the new location in "NEWLOC". The current loc is saved in "OLDLOC" in case
490 * he wants to retreat. The current OLDLOC is saved in OLDLC2, in case he
491 * dies. (if he does, NEWLOC will be limbo, and OLDLOC will be what killed
492 * him, so we need OLDLC2, which is the last place he was safe.) */
498 if(K == BACK) goto L20;
499 if(K == LOOK) goto L30;
500 if(K == CAVE) goto L40;
504 L9: LL=IABS(TRAVEL[KK]);
505 if(MOD(LL,1000) == 1 || MOD(LL,1000) == K) goto L10;
506 if(TRAVEL[KK] < 0) goto L50;
513 if(NEWLOC <= 300) goto L13;
514 if(PROP[K] != NEWLOC/100-3) goto L16;
515 L12: if(TRAVEL[KK] < 0)BUG(25);
517 NEWLOC=IABS(TRAVEL[KK])/1000;
518 if(NEWLOC == LL) goto L12;
522 L13: if(NEWLOC <= 100) goto L14;
523 if(TOTING(K) || (NEWLOC > 200 && AT(K))) goto L16;
526 L14: if(NEWLOC != 0 && !PCT(NEWLOC)) goto L12;
527 L16: NEWLOC=MOD(LL,1000);
528 if(NEWLOC <= 300) return;
529 if(NEWLOC <= 500) goto L30000;
534 /* Special motions come here. Labelling convention: statement numbers NNNXX
535 * (XX=00-99) are used for special case number NNN (NNN=301-500). */
537 L30000: NEWLOC=NEWLOC-300;
538 switch (NEWLOC) { case 1: goto L30100; case 2: goto L30200; case 3: goto
542 /* Travel 301. Plover-alcove passage. Can carry only emerald. Note: travel
543 * table must include "useless" entries going through passage, which can never
544 * be used for actual motion, but can be spotted by "go back". */
546 L30100: NEWLOC=99+100-LOC;
547 if(HOLDNG == 0 || (HOLDNG == 1 && TOTING(EMRALD))) return;
552 /* Travel 302. Plover transport. Drop the emerald (only use special travel if
553 * toting it), so he's forced to use the plover-passage to get it out. Having
554 * dropped it, go back and pretend he wasn't carrying it after all. */
556 L30200: DROP(EMRALD,LOC);
559 /* Travel 303. Troll bridge. Must be done only as special motion so that
560 * dwarves won't wander across and encounter the bear. (They won't follow the
561 * player there because that region is forbidden to the pirate.) If
562 * PROP(TROLL)=1, he's crossed since paying, so step out and block him.
563 * (standard travel entries check for PROP(TROLL)=0.) Special stuff for bear. */
565 L30300: if(PROP[TROLL] != 1) goto L30310;
570 MOVE(TROLL,PLAC[TROLL]);
571 MOVE(TROLL+100,FIXD[TROLL]);
576 L30310: NEWLOC=PLAC[TROLL]+FIXD[TROLL]-LOC;
577 if(PROP[TROLL] == 0)PROP[TROLL]=1;
578 if(!TOTING(BEAR)) return;
588 /* End of specials. */
590 /* Handle "go back". Look for verb which goes from LOC to OLDLOC, or to OLDLC2
591 * If OLDLOC has forced-motion. K2 saves entry -> forced loc -> previous loc. */
594 if(FORCED(K))K=OLDLC2;
599 if(CNDBIT(LOC,4))K2=274;
600 if(K2 == 0) goto L21;
604 L21: LL=MOD((IABS(TRAVEL[KK])/1000),1000);
605 if(LL == K) goto L25;
606 if(LL > 300) goto L22;
608 if(FORCED(LL) && MOD((IABS(TRAVEL[J])/1000),1000) == K)K2=KK;
609 L22: if(TRAVEL[KK] < 0) goto L23;
614 if(KK != 0) goto L25;
618 L25: K=MOD(IABS(TRAVEL[KK]),1000);
622 /* Look. Can't give more detail. Pretend it wasn't dark (though it may "now"
623 * be dark) so he won't fall into a pit while staring into the gloom. */
625 L30: if(DETAIL < 3)RSPEAK(15);
631 /* Cave. Different messages depending on whether above ground. */
634 if(OUTSID(LOC) && LOC != 8)K=57;
638 /* Non-applicable motion. Various messages depending on word given. */
641 if(K >= 43 && K <= 50)SPK=52;
642 if(K == 29 || K == 30)SPK=52;
643 if(K == 7 || K == 36 || K == 37)SPK=10;
644 if(K == 11 || K == 19)SPK=11;
645 if(VERB == FIND || VERB == INVENT)SPK=59;
646 if(K == 62 || K == 65)SPK=42;
655 /* "You're dead, Jim."
657 * If the current loc is zero, it means the clown got himself killed. We'll
658 * allow this maxdie times. MAXDIE is automatically set based on the number of
659 * snide messages available. Each death results in a message (81, 83, etc.)
660 * which offers reincarnation; if accepted, this results in message 82, 84,
661 * etc. The last time, if he wants another chance, he gets a snide remark as
662 * we exit. When reincarnated, all objects being carried get dropped at OLDLC2
663 * (presumably the last place prior to being killed) without change of props.
664 * the loop runs backwards to assure that the bird is dropped before the cage.
665 * (this kluge could be changed once we're sure all references to bird and cage
666 * are done by keywords.) The lamp is a special case (it wouldn't do to leave
667 * it in the cave). It is turned off and left outside the building (only if he
668 * was carrying it, of course). He himself is left inside the building (and
669 * heaven help him if he tries to xyzzy back into the cave without the lamp!).
670 * OLDLOC is zapped so he can't just "retreat". */
672 /* The easiest way to get killed is to fall into a pit in pitch darkness. */
677 /* Okay, he's dead. Let's get on with it. */
679 L99: if(CLOSNG) goto L95;
681 if(!YES(cmdin,79+NUMDIE*2,80+NUMDIE*2,54)) score(0);
682 if(NUMDIE == MAXDIE) score(0);
685 if(TOTING(LAMP))PROP[LAMP]=0;
686 /* 98 */ for (J=1; J<=100; J++) {
688 if(!TOTING(I)) goto L98;
698 /* He died during closing time. No resurrection. Tally up a death and exit. */
709 /* Come here if he's been long enough at required loc(s) for some unused hint.
710 * hint number is in variable "hint". Branch to quick test for additional
711 * conditions, then come back to do neat stuff. Goto 40010 if conditions are
712 * met and we want to offer the hint. Goto 40020 to clear HINTLC back to zero,
713 * 40030 to take no action yet. */
715 L40000: switch (HINT-1) { case 0: goto L40100; case 1: goto L40200; case 2: goto
716 L40300; case 3: goto L40400; case 4: goto L40500; case 5: goto
717 L40600; case 6: goto L40700; case 7: goto L40800; case 8: goto
718 L40900; case 9: goto L41000; }
719 /* CAVE BIRD SNAKE MAZE DARK WITT URN WOODS OGRE
723 L40010: HINTLC[HINT]=0;
724 if(!YES(cmdin,HINTS[HINT][3],0,54)) goto L2602;
725 SETPRM(1,HINTS[HINT][2],HINTS[HINT][2]);
727 HINTED[HINT]=YES(cmdin,175,HINTS[HINT][4],54);
728 if(HINTED[HINT] && LIMIT > 30)LIMIT=LIMIT+30*HINTS[HINT][2];
729 L40020: HINTLC[HINT]=0;
732 /* Now for the quick tests. See database description for one-line notes. */
734 L40100: if(PROP[GRATE] == 0 && !HERE(KEYS)) goto L40010;
737 L40200: if(PLACE[BIRD] == LOC && TOTING(ROD) && OLDOBJ == BIRD) goto L40010;
740 L40300: if(HERE(SNAKE) && !HERE(BIRD)) goto L40010;
743 L40400: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0 && HOLDNG >
747 L40500: if(PROP[EMRALD] != -1 && PROP[PYRAM] == -1) goto L40010;
752 L40700: if(DFLAG == 0) goto L40010;
755 L40800: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0) goto
759 L40900: I=ATDWRF(LOC);
760 if(I < 0) goto L40020;
761 if(HERE(OGRE) && I == 0) goto L40010;
764 L41000: if(TALLY == 1 && PROP[JADE] < 0) goto L40010;
771 /* Cave closing and scoring */
774 /* These sections handle the closing of the cave. The cave closes "clock1"
775 * turns after the last treasure has been located (including the pirate's
776 * chest, which may of course never show up). Note that the treasures need not
777 * have been taken yet, just located. Hence clock1 must be large enough to get
778 * out of the cave (it only ticks while inside the cave). When it hits zero,
779 * we branch to 10000 to start closing the cave, and then sit back and wait for
780 * him to try to get out. If he doesn't within clock2 turns, we close the
781 * cave; if he does try, we assume he panics, and give him a few additional
782 * turns to get frantic before we close. When clock2 hits zero, we branch to
783 * 11000 to transport him into the final puzzle. Note that the puzzle depends
784 * upon all sorts of random things. For instance, there must be no water or
785 * oil, since there are beanstalks which we don't want to be able to water,
786 * since the code can't handle it. Also, we can have no keys, since there is a
787 * grate (having moved the fixed object!) there separating him from all the
788 * treasures. Most of these problems arise from the use of negative prop
789 * numbers to suppress the object descriptions until he's actually moved the
792 /* When the first warning comes, we lock the grate, destroy the bridge, kill
793 * all the dwarves (and the pirate), remove the troll and bear (unless dead),
794 * and set "closng" to true. Leave the dragon; too much trouble to move it.
795 * from now until clock2 runs out, he cannot unlock the grate, move to any
796 * location outside the cave, or create the bridge. Nor can he be
797 * resurrected if he dies. Note that the snake is already gone, since he got
798 * to the treasure accessible only via the hall of the mountain king. Also, he's
799 * been in giant room (to get eggs), so we can refer to it. Also also, he's
800 * gotten the pearl, so we know the bivalve is an oyster. *And*, the dwarves
801 * must have been activated, since we've found chest. */
803 L10000: PROP[GRATE]=0;
805 for (I=1; I<=6; I++) {
811 MOVE(TROLL2,PLAC[TROLL]);
812 MOVE(TROLL2+100,FIXD[TROLL]);
814 if(PROP[BEAR] != 3)DSTROY(BEAR);
824 /* Once he's panicked, and clock2 has run out, we come here to set up the
825 * storage room. The room has two locs, hardwired as 115 (ne) and 116 (sw).
826 * At the ne end, we place empty bottles, a nursery of plants, a bed of
827 * oysters, a pile of lamps, rods with stars, sleeping dwarves, and him. At
828 * the sw end we place grate over treasures, snake pit, covey of caged birds,
829 * more rods, and pillows. A mirror stretches across one wall. Many of the
830 * objects come from known locations and/or states (e.g. the snake is known to
831 * have been destroyed and needn't be carried away from its old "place"),
832 * making the various objects be handled differently. We also drop all other
833 * objects he might be carrying (lest he have some which could cause trouble,
834 * such as the keys). We describe the flash of light and trundle back. */
836 L11000: PROP[BOTTLE]=PUT(BOTTLE,115,1);
837 PROP[PLANT]=PUT(PLANT,115,0);
838 PROP[OYSTER]=PUT(OYSTER,115,0);
840 PROP[LAMP]=PUT(LAMP,115,0);
841 PROP[ROD]=PUT(ROD,115,0);
842 PROP[DWARF]=PUT(DWARF,115,0);
847 /* Leave the grate with normal (non-negative) property. Reuse sign. */
851 OBJTXT[SIGN]=OBJTXT[SIGN]+1;
852 PROP[SNAKE]=PUT(SNAKE,116,1);
853 PROP[BIRD]=PUT(BIRD,116,1);
854 PROP[CAGE]=PUT(CAGE,116,0);
855 PROP[ROD2]=PUT(ROD2,116,0);
856 PROP[PILLOW]=PUT(PILLOW,116,0);
858 PROP[MIRROR]=PUT(MIRROR,115,0);
861 for (I=1; I<=100; I++) {
862 if(TOTING(I))DSTROY(I);
869 /* Another way we can force an end to things is by having the lamp give out.
870 * When it gets close, we come here to warn him. We go to 12000 if the lamp
871 * and fresh batteries are here, in which case we replace the batteries and
872 * continue. 12200 is for other cases of lamp dying. 12400 is when it goes
873 * out. Even then, he can explore outside for a while if desired. */
877 if(TOTING(BATTER))DROP(BATTER,LOC);
882 L12200: if(LMWARN || !HERE(LAMP)) goto L19999;
885 if(PLACE[BATTER] == 0)SPK=183;
886 if(PROP[BATTER] == 1)SPK=189;
892 if(HERE(LAMP))RSPEAK(184);
895 /* Oh dear, he's disturbed the dwarves. */