Don Wood's 430-point Adventure 2.5 from 1995, from rec.games.int-fiction.
This commit is contained in:
Eric S. Raymond
commit
24d7aeaf8a
14 changed files with 6166 additions and 0 deletions
23
Makefile
Normal file
23
Makefile
Normal file
|
|
@ -0,0 +1,23 @@
|
||||||
|
# NOTE: This version of Adventure was developed by the author on private
|
||||||
|
# equipment, and has been ported to Sun for entertainment purposes only.
|
||||||
|
# The author (Don Woods) retains full rights to the work.
|
||||||
|
|
||||||
|
OBJS=main.o init.o actions1.o actions2.o score.o misc.o datime.o
|
||||||
|
|
||||||
|
.c.o:
|
||||||
|
gcc -O $(DBX) -c $<
|
||||||
|
|
||||||
|
adventure: $(OBJS)
|
||||||
|
gcc -O $(DBX) -o adventure $(OBJS)
|
||||||
|
|
||||||
|
main.o: misc.h funcs.h
|
||||||
|
|
||||||
|
init.o: misc.h main.h share.h funcs.h
|
||||||
|
|
||||||
|
actions1.o: misc.h main.h share.h funcs.h
|
||||||
|
|
||||||
|
actions2.o: misc.h main.h share.h funcs.h
|
||||||
|
|
||||||
|
score.o: misc.h main.h share.h
|
||||||
|
|
||||||
|
misc.o: misc.h main.h
|
||||||
589
actions1.c
Normal file
589
actions1.c
Normal file
|
|
@ -0,0 +1,589 @@
|
||||||
|
#include "misc.h"
|
||||||
|
#include "main.h"
|
||||||
|
#include "share.h"
|
||||||
|
#include "funcs.h"
|
||||||
|
|
||||||
|
#define TRUE (0==0)
|
||||||
|
#define FALSE (0!=0)
|
||||||
|
|
||||||
|
extern carry(), discard(long), attack(), throw(), feed(), fill();
|
||||||
|
|
||||||
|
/* This stuff was broken off as part of an effort to get the main program
|
||||||
|
* to compile without running out of memory. We're called with a number
|
||||||
|
* that says what label the caller wanted to "goto", and we return a
|
||||||
|
* similar label number for the caller to "goto".
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* ANALYSE A VERB. REMEMBER WHAT IT WAS, GO BACK FOR OBJECT IF SECOND WORD
|
||||||
|
* UNLESS VERB IS "SAY", WHICH SNARFS ARBITRARY SECOND WORD. */
|
||||||
|
|
||||||
|
action(STARTAT)long STARTAT; {
|
||||||
|
switch(STARTAT) {
|
||||||
|
case 4000: goto L4000;
|
||||||
|
case 4090: goto L4090;
|
||||||
|
case 5000: goto L5000;
|
||||||
|
}
|
||||||
|
BUG(99);
|
||||||
|
|
||||||
|
L4000: VERB=K;
|
||||||
|
SPK=ACTSPK[VERB];
|
||||||
|
if(WD2 > 0 && VERB != SAY) return(2800);
|
||||||
|
if(VERB == SAY)OBJ=WD2;
|
||||||
|
if(OBJ > 0) goto L4090;
|
||||||
|
|
||||||
|
/* ANALYSE AN INTRANSITIVE VERB (IE, NO OBJECT GIVEN YET). */
|
||||||
|
|
||||||
|
L4080: switch (VERB-1) { case 0: goto L8010; case 1: return(8000); case 2:
|
||||||
|
return(8000); case 3: goto L8040; case 4: return(2009); case 5: goto L8040;
|
||||||
|
case 6: goto L8070; case 7: goto L8080; case 8: return(8000); case
|
||||||
|
9: return(8000); case 10: return(2011); case 11: goto L9120; case 12:
|
||||||
|
goto L9130; case 13: goto L8140; case 14: goto L9150; case 15:
|
||||||
|
return(8000); case 16: return(8000); case 17: goto L8180; case 18:
|
||||||
|
return(8000); case 19: goto L8200; case 20: return(8000); case 21:
|
||||||
|
goto L9220; case 22: goto L9230; case 23: goto L8240; case 24:
|
||||||
|
goto L8250; case 25: goto L8260; case 26: goto L8270; case 27:
|
||||||
|
return(8000); case 28: return(8000); case 29: goto L8300; case 30:
|
||||||
|
goto L8310; case 31: goto L8320; case 32: goto L8330; case 33:
|
||||||
|
goto L8340; }
|
||||||
|
/* TAKE DROP SAY OPEN NOTH LOCK ON OFF WAVE CALM
|
||||||
|
* WALK KILL POUR EAT DRNK RUB TOSS QUIT FIND INVN
|
||||||
|
* FEED FILL BLST SCOR FOO BRF READ BREK WAKE SUSP
|
||||||
|
* RESU FLY LSTN ZZZZ */
|
||||||
|
BUG(23);
|
||||||
|
|
||||||
|
/* ANALYSE A TRANSITIVE VERB. */
|
||||||
|
|
||||||
|
L4090: switch (VERB-1) { case 0: goto L9010; case 1: goto L9020; case 2: goto
|
||||||
|
L9030; case 3: goto L9040; case 4: return(2009); case 5: goto L9040;
|
||||||
|
case 6: goto L9070; case 7: goto L9080; case 8: goto L9090; case
|
||||||
|
9: return(2011); case 10: return(2011); case 11: goto L9120; case 12:
|
||||||
|
goto L9130; case 13: goto L9140; case 14: goto L9150; case 15:
|
||||||
|
goto L9160; case 16: goto L9170; case 17: return(2011); case 18:
|
||||||
|
goto L9190; case 19: goto L9190; case 20: goto L9210; case 21:
|
||||||
|
goto L9220; case 22: goto L9230; case 23: return(2011); case 24:
|
||||||
|
return(2011); case 25: return(2011); case 26: goto L9270; case 27:
|
||||||
|
goto L9280; case 28: goto L9290; case 29: return(2011); case 30:
|
||||||
|
return(2011); case 31: goto L9320; case 32: return(2011); case 33:
|
||||||
|
goto L8340; }
|
||||||
|
/* TAKE DROP SAY OPEN NOTH LOCK ON OFF WAVE CALM
|
||||||
|
* WALK KILL POUR EAT DRNK RUB TOSS QUIT FIND INVN
|
||||||
|
* FEED FILL BLST SCOR FOO BRF READ BREK WAKE SUSP
|
||||||
|
* RESU FLY LSTN ZZZZ */
|
||||||
|
BUG(24);
|
||||||
|
|
||||||
|
/* ANALYSE AN OBJECT WORD. SEE IF THE THING IS HERE, WHETHER WE'VE GOT A VERB
|
||||||
|
* YET, AND SO ON. OBJECT MUST BE HERE UNLESS VERB IS "FIND" OR "INVENT(ORY)"
|
||||||
|
* (AND NO NEW VERB YET TO BE ANALYSED). WATER AND OIL ARE ALSO FUNNY, SINCE
|
||||||
|
* THEY ARE NEVER ACTUALLY DROPPED AT ANY LOCATION, BUT MIGHT BE HERE INSIDE
|
||||||
|
* THE BOTTLE OR URN OR AS A FEATURE OF THE LOCATION. */
|
||||||
|
|
||||||
|
L5000: OBJ=K;
|
||||||
|
if(!HERE(K)) goto L5100;
|
||||||
|
L5010: if(WD2 > 0) return(2800);
|
||||||
|
if(VERB != 0) goto L4090;
|
||||||
|
SETPRM(1,WD1,WD1X);
|
||||||
|
RSPEAK(255);
|
||||||
|
return(2600);
|
||||||
|
|
||||||
|
L5100: if(K != GRATE) goto L5110;
|
||||||
|
if(LOC == 1 || LOC == 4 || LOC == 7)K=DPRSSN;
|
||||||
|
if(LOC > 9 && LOC < 15)K=ENTRNC;
|
||||||
|
if(K != GRATE) return(8);
|
||||||
|
L5110: if(K == DWARF && ATDWRF(LOC) > 0) goto L5010;
|
||||||
|
if((LIQ(0) == K && HERE(BOTTLE)) || K == LIQLOC(LOC)) goto L5010;
|
||||||
|
if(OBJ != OIL || !HERE(URN) || PROP[URN] == 0) goto L5120;
|
||||||
|
OBJ=URN;
|
||||||
|
goto L5010;
|
||||||
|
L5120: if(OBJ != PLANT || !AT(PLANT2) || PROP[PLANT2] == 0) goto L5130;
|
||||||
|
OBJ=PLANT2;
|
||||||
|
goto L5010;
|
||||||
|
L5130: if(OBJ != KNIFE || KNFLOC != LOC) goto L5140;
|
||||||
|
KNFLOC= -1;
|
||||||
|
SPK=116;
|
||||||
|
return(2011);
|
||||||
|
L5140: if(OBJ != ROD || !HERE(ROD2)) goto L5190;
|
||||||
|
OBJ=ROD2;
|
||||||
|
goto L5010;
|
||||||
|
L5190: if((VERB == FIND || VERB == INVENT) && WD2 <= 0) goto L5010;
|
||||||
|
SETPRM(1,WD1,WD1X);
|
||||||
|
RSPEAK(256);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* ROUTINES FOR PERFORMING THE VARIOUS ACTION VERBS */
|
||||||
|
|
||||||
|
/* STATEMENT NUMBERS IN THIS SECTION ARE 8000 FOR INTRANSITIVE VERBS, 9000 FOR
|
||||||
|
* TRANSITIVE, PLUS TEN TIMES THE VERB NUMBER. MANY INTRANSITIVE VERBS USE THE
|
||||||
|
* TRANSITIVE CODE, AND SOME VERBS USE CODE FOR OTHER VERBS, AS NOTED BELOW. */
|
||||||
|
|
||||||
|
/* CARRY, NO OBJECT GIVEN YET. OK IF ONLY ONE OBJECT PRESENT. */
|
||||||
|
|
||||||
|
L8010: if(ATLOC[LOC] == 0 || LINK[ATLOC[LOC]] != 0 || ATDWRF(LOC) > 0) return(8000);
|
||||||
|
OBJ=ATLOC[LOC];
|
||||||
|
|
||||||
|
/* TRANSITIVE CARRY/DROP ARE IN SEPARATE FILE. */
|
||||||
|
|
||||||
|
L9010: return(carry());
|
||||||
|
L9020: return(discard(FALSE));
|
||||||
|
|
||||||
|
/* SAY. ECHO WD2 (OR WD1 IF NO WD2 (SAY WHAT?, ETC.).) MAGIC WORDS OVERRIDE. */
|
||||||
|
|
||||||
|
L9030: SETPRM(1,WD2,WD2X);
|
||||||
|
if(WD2 <= 0)SETPRM(1,WD1,WD1X);
|
||||||
|
if(WD2 > 0)WD1=WD2;
|
||||||
|
I=VOCAB(WD1,-1);
|
||||||
|
if(I == 62 || I == 65 || I == 71 || I == 2025 || I == 2034) goto L9035;
|
||||||
|
RSPEAK(258);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9035: WD2=0;
|
||||||
|
OBJ=0;
|
||||||
|
return(2630);
|
||||||
|
|
||||||
|
/* LOCK, UNLOCK, NO OBJECT GIVEN. ASSUME VARIOUS THINGS IF PRESENT. */
|
||||||
|
|
||||||
|
L8040: SPK=28;
|
||||||
|
if(HERE(CLAM))OBJ=CLAM;
|
||||||
|
if(HERE(OYSTER))OBJ=OYSTER;
|
||||||
|
if(AT(DOOR))OBJ=DOOR;
|
||||||
|
if(AT(GRATE))OBJ=GRATE;
|
||||||
|
if(OBJ != 0 && HERE(CHAIN)) return(8000);
|
||||||
|
if(HERE(CHAIN))OBJ=CHAIN;
|
||||||
|
if(OBJ == 0) return(2011);
|
||||||
|
|
||||||
|
/* LOCK, UNLOCK OBJECT. SPECIAL STUFF FOR OPENING CLAM/OYSTER AND FOR CHAIN. */
|
||||||
|
|
||||||
|
L9040: if(OBJ == CLAM || OBJ == OYSTER) goto L9046;
|
||||||
|
if(OBJ == DOOR)SPK=111;
|
||||||
|
if(OBJ == DOOR && PROP[DOOR] == 1)SPK=54;
|
||||||
|
if(OBJ == CAGE)SPK=32;
|
||||||
|
if(OBJ == KEYS)SPK=55;
|
||||||
|
if(OBJ == GRATE || OBJ == CHAIN)SPK=31;
|
||||||
|
if(SPK != 31 || !HERE(KEYS)) return(2011);
|
||||||
|
if(OBJ == CHAIN) goto L9048;
|
||||||
|
if(!CLOSNG) goto L9043;
|
||||||
|
K=130;
|
||||||
|
if(!PANIC)CLOCK2=15;
|
||||||
|
PANIC=TRUE;
|
||||||
|
return(2010);
|
||||||
|
|
||||||
|
L9043: K=34+PROP[GRATE];
|
||||||
|
PROP[GRATE]=1;
|
||||||
|
if(VERB == LOCK)PROP[GRATE]=0;
|
||||||
|
K=K+2*PROP[GRATE];
|
||||||
|
return(2010);
|
||||||
|
|
||||||
|
/* CLAM/OYSTER. */
|
||||||
|
L9046: K=0;
|
||||||
|
if(OBJ == OYSTER)K=1;
|
||||||
|
SPK=124+K;
|
||||||
|
if(TOTING(OBJ))SPK=120+K;
|
||||||
|
if(!TOTING(TRIDNT))SPK=122+K;
|
||||||
|
if(VERB == LOCK)SPK=61;
|
||||||
|
if(SPK != 124) return(2011);
|
||||||
|
DSTROY(CLAM);
|
||||||
|
DROP(OYSTER,LOC);
|
||||||
|
DROP(PEARL,105);
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* CHAIN. */
|
||||||
|
L9048: if(VERB == LOCK) goto L9049;
|
||||||
|
SPK=171;
|
||||||
|
if(PROP[BEAR] == 0)SPK=41;
|
||||||
|
if(PROP[CHAIN] == 0)SPK=37;
|
||||||
|
if(SPK != 171) return(2011);
|
||||||
|
PROP[CHAIN]=0;
|
||||||
|
FIXED[CHAIN]=0;
|
||||||
|
if(PROP[BEAR] != 3)PROP[BEAR]=2;
|
||||||
|
FIXED[BEAR]=2-PROP[BEAR];
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9049: SPK=172;
|
||||||
|
if(PROP[CHAIN] != 0)SPK=34;
|
||||||
|
if(LOC != PLAC[CHAIN])SPK=173;
|
||||||
|
if(SPK != 172) return(2011);
|
||||||
|
PROP[CHAIN]=2;
|
||||||
|
if(TOTING(CHAIN))DROP(CHAIN,LOC);
|
||||||
|
FIXED[CHAIN]= -1;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* LIGHT. APPLICABLE ONLY TO LAMP AND URN. */
|
||||||
|
|
||||||
|
L8070: if(HERE(LAMP) && PROP[LAMP] == 0 && LIMIT >= 0)OBJ=LAMP;
|
||||||
|
if(HERE(URN) && PROP[URN] == 1)OBJ=OBJ*100+URN;
|
||||||
|
if(OBJ == 0 || OBJ > 100) return(8000);
|
||||||
|
|
||||||
|
L9070: if(OBJ == URN) goto L9073;
|
||||||
|
if(OBJ != LAMP) return(2011);
|
||||||
|
SPK=184;
|
||||||
|
if(LIMIT < 0) return(2011);
|
||||||
|
PROP[LAMP]=1;
|
||||||
|
RSPEAK(39);
|
||||||
|
if(WZDARK) return(2000);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9073: SPK=38;
|
||||||
|
if(PROP[URN] == 0) return(2011);
|
||||||
|
SPK=209;
|
||||||
|
PROP[URN]=2;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* EXTINGUISH. LAMP, URN, DRAGON/VOLCANO (NICE TRY). */
|
||||||
|
|
||||||
|
L8080: if(HERE(LAMP) && PROP[LAMP] == 1)OBJ=LAMP;
|
||||||
|
if(HERE(URN) && PROP[URN] == 2)OBJ=OBJ*100+URN;
|
||||||
|
if(OBJ == 0 || OBJ > 100) return(8000);
|
||||||
|
|
||||||
|
L9080: if(OBJ == URN) goto L9083;
|
||||||
|
if(OBJ == LAMP) goto L9086;
|
||||||
|
if(OBJ == DRAGON || OBJ == VOLCAN)SPK=146;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9083: PROP[URN]=PROP[URN]/2;
|
||||||
|
SPK=210;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9086: PROP[LAMP]=0;
|
||||||
|
RSPEAK(40);
|
||||||
|
if(DARK(0))RSPEAK(16);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
/* WAVE. NO EFFECT UNLESS WAVING ROD AT FISSURE OR AT BIRD. */
|
||||||
|
|
||||||
|
L9090: if((!TOTING(OBJ)) && (OBJ != ROD || !TOTING(ROD2)))SPK=29;
|
||||||
|
if(OBJ != ROD || !TOTING(OBJ) || (!HERE(BIRD) && (CLOSNG || !AT(FISSUR))))
|
||||||
|
return(2011);
|
||||||
|
if(HERE(BIRD))SPK=206+MOD(PROP[BIRD],2);
|
||||||
|
if(SPK == 206 && LOC == PLACE[STEPS] && PROP[JADE] < 0) goto L9094;
|
||||||
|
if(CLOSED) return(18999);
|
||||||
|
if(CLOSNG || !AT(FISSUR)) return(2011);
|
||||||
|
if(HERE(BIRD))RSPEAK(SPK);
|
||||||
|
PROP[FISSUR]=1-PROP[FISSUR];
|
||||||
|
PSPEAK(FISSUR,2-PROP[FISSUR]);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9094: DROP(JADE,LOC);
|
||||||
|
PROP[JADE]=0;
|
||||||
|
TALLY=TALLY-1;
|
||||||
|
SPK=208;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* ATTACK ALSO MOVED INTO SEPARATE MODULE. */
|
||||||
|
|
||||||
|
L9120: return(attack());
|
||||||
|
|
||||||
|
/* POUR. IF NO OBJECT, OR OBJECT IS BOTTLE, ASSUME CONTENTS OF BOTTLE.
|
||||||
|
* SPECIAL TESTS FOR POURING WATER OR OIL ON PLANT OR RUSTY DOOR. */
|
||||||
|
|
||||||
|
L9130: if(OBJ == BOTTLE || OBJ == 0)OBJ=LIQ(0);
|
||||||
|
if(OBJ == 0) return(8000);
|
||||||
|
if(!TOTING(OBJ)) return(2011);
|
||||||
|
SPK=78;
|
||||||
|
if(OBJ != OIL && OBJ != WATER) return(2011);
|
||||||
|
if(HERE(URN) && PROP[URN] == 0) goto L9134;
|
||||||
|
PROP[BOTTLE]=1;
|
||||||
|
PLACE[OBJ]=0;
|
||||||
|
SPK=77;
|
||||||
|
if(!(AT(PLANT) || AT(DOOR))) return(2011);
|
||||||
|
|
||||||
|
if(AT(DOOR)) goto L9132;
|
||||||
|
SPK=112;
|
||||||
|
if(OBJ != WATER) return(2011);
|
||||||
|
PSPEAK(PLANT,PROP[PLANT]+3);
|
||||||
|
PROP[PLANT]=MOD(PROP[PLANT]+1,3);
|
||||||
|
PROP[PLANT2]=PROP[PLANT];
|
||||||
|
K=NUL;
|
||||||
|
return(8);
|
||||||
|
|
||||||
|
L9132: PROP[DOOR]=0;
|
||||||
|
if(OBJ == OIL)PROP[DOOR]=1;
|
||||||
|
SPK=113+PROP[DOOR];
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9134: OBJ=URN;
|
||||||
|
goto L9220;
|
||||||
|
|
||||||
|
/* EAT. INTRANSITIVE: ASSUME FOOD IF PRESENT, ELSE ASK WHAT. TRANSITIVE: FOOD
|
||||||
|
* OK, SOME THINGS LOSE APPETITE, REST ARE RIDICULOUS. */
|
||||||
|
|
||||||
|
L8140: if(!HERE(FOOD)) return(8000);
|
||||||
|
L8142: DSTROY(FOOD);
|
||||||
|
SPK=72;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9140: if(OBJ == FOOD) goto L8142;
|
||||||
|
if(OBJ == BIRD || OBJ == SNAKE || OBJ == CLAM || OBJ == OYSTER || OBJ ==
|
||||||
|
DWARF || OBJ == DRAGON || OBJ == TROLL || OBJ == BEAR || OBJ ==
|
||||||
|
OGRE)SPK=71;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* DRINK. IF NO OBJECT, ASSUME WATER AND LOOK FOR IT HERE. IF WATER IS IN
|
||||||
|
* THE BOTTLE, DRINK THAT, ELSE MUST BE AT A WATER LOC, SO DRINK STREAM. */
|
||||||
|
|
||||||
|
L9150: if(OBJ == 0 && LIQLOC(LOC) != WATER && (LIQ(0) != WATER || !HERE(BOTTLE)))
|
||||||
|
return(8000);
|
||||||
|
if(OBJ == BLOOD) goto L9153;
|
||||||
|
if(OBJ != 0 && OBJ != WATER)SPK=110;
|
||||||
|
if(SPK == 110 || LIQ(0) != WATER || !HERE(BOTTLE)) return(2011);
|
||||||
|
PROP[BOTTLE]=1;
|
||||||
|
PLACE[WATER]=0;
|
||||||
|
SPK=74;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9153: DSTROY(BLOOD);
|
||||||
|
PROP[DRAGON]=2;
|
||||||
|
OBJSND[BIRD]=OBJSND[BIRD]+3;
|
||||||
|
SPK=240;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* RUB. YIELDS VARIOUS SNIDE REMARKS EXCEPT FOR LIT URN. */
|
||||||
|
|
||||||
|
L9160: if(OBJ != LAMP)SPK=76;
|
||||||
|
if(OBJ != URN || PROP[URN] != 2) return(2011);
|
||||||
|
DSTROY(URN);
|
||||||
|
DROP(AMBER,LOC);
|
||||||
|
PROP[AMBER]=1;
|
||||||
|
TALLY=TALLY-1;
|
||||||
|
DROP(CAVITY,LOC);
|
||||||
|
SPK=216;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* THROW MOVED INTO SEPARATE MODULE. */
|
||||||
|
|
||||||
|
L9170: return(throw());
|
||||||
|
|
||||||
|
/* QUIT. INTRANSITIVE ONLY. VERIFY INTENT AND EXIT IF THAT'S WHAT HE WANTS. */
|
||||||
|
|
||||||
|
L8180: if(YES(22,54,54)) score(1);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
/* FIND. MIGHT BE CARRYING IT, OR IT MIGHT BE HERE. ELSE GIVE CAVEAT. */
|
||||||
|
|
||||||
|
L9190: if(AT(OBJ) || (LIQ(0) == OBJ && AT(BOTTLE)) || K == LIQLOC(LOC) || (OBJ ==
|
||||||
|
DWARF && ATDWRF(LOC) > 0))SPK=94;
|
||||||
|
if(CLOSED)SPK=138;
|
||||||
|
if(TOTING(OBJ))SPK=24;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* INVENTORY. IF OBJECT, TREAT SAME AS FIND. ELSE REPORT ON CURRENT BURDEN. */
|
||||||
|
|
||||||
|
L8200: SPK=98;
|
||||||
|
/* 8201 */ for (I=1; I<=100; I++) {
|
||||||
|
if(I == BEAR || !TOTING(I)) goto L8201;
|
||||||
|
if(SPK == 98)RSPEAK(99);
|
||||||
|
BLKLIN=FALSE;
|
||||||
|
PSPEAK(I,-1);
|
||||||
|
BLKLIN=TRUE;
|
||||||
|
SPK=0;
|
||||||
|
L8201: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
if(TOTING(BEAR))SPK=141;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* FEED/FILL ARE IN THE OTHER MODULE. */
|
||||||
|
|
||||||
|
L9210: return(feed());
|
||||||
|
L9220: return(fill());
|
||||||
|
|
||||||
|
/* BLAST. NO EFFECT UNLESS YOU'VE GOT DYNAMITE, WHICH IS A NEAT TRICK! */
|
||||||
|
|
||||||
|
L9230: if(PROP[ROD2] < 0 || !CLOSED) return(2011);
|
||||||
|
BONUS=133;
|
||||||
|
if(LOC == 115)BONUS=134;
|
||||||
|
if(HERE(ROD2))BONUS=135;
|
||||||
|
RSPEAK(BONUS);
|
||||||
|
score(0);
|
||||||
|
|
||||||
|
/* SCORE. CALL SCORING ROUTINE BUT TELL IT TO RETURN. */
|
||||||
|
|
||||||
|
L8240: score(-1);
|
||||||
|
SETPRM(1,SCORE,MXSCOR);
|
||||||
|
SETPRM(3,TURNS,TURNS);
|
||||||
|
RSPEAK(259);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
/* FEE FIE FOE FOO (AND FUM). ADVANCE TO NEXT STATE IF GIVEN IN PROPER ORDER.
|
||||||
|
* LOOK UP WD1 IN SECTION 3 OF VOCAB TO DETERMINE WHICH WORD WE'VE GOT. LAST
|
||||||
|
* WORD ZIPS THE EGGS BACK TO THE GIANT ROOM (UNLESS ALREADY THERE). */
|
||||||
|
|
||||||
|
L8250: K=VOCAB(WD1,3);
|
||||||
|
SPK=42;
|
||||||
|
if(FOOBAR == 1-K) goto L8252;
|
||||||
|
if(FOOBAR != 0)SPK=151;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L8252: FOOBAR=K;
|
||||||
|
if(K != 4) return(2009);
|
||||||
|
FOOBAR=0;
|
||||||
|
if(PLACE[EGGS] == PLAC[EGGS] || (TOTING(EGGS) && LOC == PLAC[EGGS]))
|
||||||
|
return(2011);
|
||||||
|
/* BRING BACK TROLL IF WE STEAL THE EGGS BACK FROM HIM BEFORE CROSSING. */
|
||||||
|
if(PLACE[EGGS] == 0 && PLACE[TROLL] == 0 && PROP[TROLL] ==
|
||||||
|
0)PROP[TROLL]=1;
|
||||||
|
K=2;
|
||||||
|
if(HERE(EGGS))K=1;
|
||||||
|
if(LOC == PLAC[EGGS])K=0;
|
||||||
|
MOVE(EGGS,PLAC[EGGS]);
|
||||||
|
PSPEAK(EGGS,K);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
/* BRIEF. INTRANSITIVE ONLY. SUPPRESS LONG DESCRIPTIONS AFTER FIRST TIME. */
|
||||||
|
|
||||||
|
L8260: SPK=156;
|
||||||
|
ABBNUM=10000;
|
||||||
|
DETAIL=3;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* READ. PRINT STUFF BASED ON OBJTXT. OYSTER (?) IS SPECIAL CASE. */
|
||||||
|
|
||||||
|
L8270: /* 8275 */ for (I=1; I<=100; I++) {
|
||||||
|
L8275: if(HERE(I) && OBJTXT[I] != 0 && PROP[I] >= 0)OBJ=OBJ*100+I;
|
||||||
|
} /* end loop */
|
||||||
|
if(OBJ > 100 || OBJ == 0 || DARK(0)) return(8000);
|
||||||
|
|
||||||
|
L9270: if(DARK(0)) goto L5190;
|
||||||
|
if(OBJTXT[OBJ] == 0 || PROP[OBJ] < 0) return(2011);
|
||||||
|
if(OBJ == OYSTER && !CLSHNT) goto L9275;
|
||||||
|
PSPEAK(OBJ,OBJTXT[OBJ]+PROP[OBJ]);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9275: CLSHNT=YES(192,193,54);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
/* BREAK. ONLY WORKS FOR MIRROR IN REPOSITORY AND, OF COURSE, THE VASE. */
|
||||||
|
|
||||||
|
L9280: if(OBJ == MIRROR)SPK=148;
|
||||||
|
if(OBJ == VASE && PROP[VASE] == 0) goto L9282;
|
||||||
|
if(OBJ != MIRROR || !CLOSED) return(2011);
|
||||||
|
SPK=197;
|
||||||
|
return(18999);
|
||||||
|
|
||||||
|
L9282: SPK=198;
|
||||||
|
if(TOTING(VASE))DROP(VASE,LOC);
|
||||||
|
PROP[VASE]=2;
|
||||||
|
FIXED[VASE]= -1;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* WAKE. ONLY USE IS TO DISTURB THE DWARVES. */
|
||||||
|
|
||||||
|
L9290: if(OBJ != DWARF || !CLOSED) return(2011);
|
||||||
|
SPK=199;
|
||||||
|
return(18999);
|
||||||
|
|
||||||
|
/* SUSPEND. OFFER TO SAVE THINGS IN A FILE, BUT CHARGING SOME POINTS (SO
|
||||||
|
* CAN'T WIN BY USING SAVED GAMES TO RETRY BATTLES OR TO START OVER AFTER
|
||||||
|
* LEARNING ZZWORD). */
|
||||||
|
|
||||||
|
L8300: SPK=201;
|
||||||
|
RSPEAK(260);
|
||||||
|
if(!YES(200,54,54)) return(2012);
|
||||||
|
SAVED=SAVED+5;
|
||||||
|
KK= -1;
|
||||||
|
|
||||||
|
/* THIS NEXT PART IS SHARED WITH THE "RESUME" CODE. THE TWO CASES ARE
|
||||||
|
* DISTINGUISHED BY THE VALUE OF KK (-1 FOR SUSPEND, +1 FOR RESUME). */
|
||||||
|
|
||||||
|
L8305: DATIME(I,K);
|
||||||
|
K=I+650*K;
|
||||||
|
SAVWRD(KK,K);
|
||||||
|
K=VRSION;
|
||||||
|
SAVWRD(0,K);
|
||||||
|
if(K != VRSION) goto L8312;
|
||||||
|
/* HEREWITH ARE ALL THE VARIABLES WHOSE VALUES CAN CHANGE DURING A GAME,
|
||||||
|
* OMITTING A FEW (SUCH AS I, J, ATTACK) WHOSE VALUES BETWEEN TURNS ARE
|
||||||
|
* IRRELEVANT AND SOME WHOSE VALUES WHEN A GAME IS
|
||||||
|
* SUSPENDED OR RESUMED ARE GUARANTEED TO MATCH. IF UNSURE WHETHER A VALUE
|
||||||
|
* NEEDS TO BE SAVED, INCLUDE IT. OVERKILL CAN'T HURT. PAD THE LAST SAVWDS
|
||||||
|
* WITH JUNK VARIABLES TO BRING IT UP TO 7 VALUES. */
|
||||||
|
SAVWDS(ABBNUM,BLKLIN,BONUS,CLOCK1,CLOCK2,CLOSED,CLOSNG);
|
||||||
|
SAVWDS(DETAIL,DFLAG,DKILL,DTOTAL,FOOBAR,HOLDNG,IWEST);
|
||||||
|
SAVWDS(KNFLOC,LIMIT,LL,LMWARN,LOC,NEWLOC,NUMDIE);
|
||||||
|
SAVWDS(OBJ,OLDLC2,OLDLOC,OLDOBJ,PANIC,SAVED,SETUP);
|
||||||
|
SAVWDS(SPK,TALLY,THRESH,TRNDEX,TRNLUZ,TURNS,OBJTXT[OYSTER]);
|
||||||
|
SAVWDS(VERB,WD1,WD1X,WD2,WZDARK,ZZWORD,OBJSND[BIRD]);
|
||||||
|
SAVWDS(OBJTXT[SIGN],CLSHNT,NOVICE,K,K,K,K);
|
||||||
|
SAVARR(ABB,LOCSIZ);
|
||||||
|
SAVARR(ATLOC,LOCSIZ);
|
||||||
|
SAVARR(DLOC,6);
|
||||||
|
SAVARR(DSEEN,6);
|
||||||
|
SAVARR(FIXED,100);
|
||||||
|
SAVARR(HINTED,HNTSIZ);
|
||||||
|
SAVARR(HINTLC,HNTSIZ);
|
||||||
|
SAVARR(LINK,200);
|
||||||
|
SAVARR(ODLOC,6);
|
||||||
|
SAVARR(PLACE,100);
|
||||||
|
SAVARR(PROP,100);
|
||||||
|
SAVWRD(KK,K);
|
||||||
|
if(K != 0) goto L8318;
|
||||||
|
K=NUL;
|
||||||
|
ZZWORD=RNDVOC(3,ZZWORD-MESH*2)+MESH*2;
|
||||||
|
if(KK > 0) return(8);
|
||||||
|
RSPEAK(266);
|
||||||
|
exit(FALSE);
|
||||||
|
|
||||||
|
/* RESUME. READ A SUSPENDED GAME BACK FROM A FILE. */
|
||||||
|
|
||||||
|
L8310: KK=1;
|
||||||
|
if(LOC == 1 && ABB[1] == 1) goto L8305;
|
||||||
|
RSPEAK(268);
|
||||||
|
if(!YES(200,54,54)) return(2012);
|
||||||
|
goto L8305;
|
||||||
|
|
||||||
|
L8312: SETPRM(1,K/10,MOD(K,10));
|
||||||
|
SETPRM(3,VRSION/10,MOD(VRSION,10));
|
||||||
|
RSPEAK(269);
|
||||||
|
return(2000);
|
||||||
|
|
||||||
|
L8318: RSPEAK(270);
|
||||||
|
exit(FALSE);
|
||||||
|
|
||||||
|
/* FLY. SNIDE REMARKS UNLESS HOVERING RUG IS HERE. */
|
||||||
|
|
||||||
|
L8320: if(PROP[RUG] != 2)SPK=224;
|
||||||
|
if(!HERE(RUG))SPK=225;
|
||||||
|
if(SPK/2 == 112) return(2011);
|
||||||
|
OBJ=RUG;
|
||||||
|
|
||||||
|
L9320: if(OBJ != RUG) return(2011);
|
||||||
|
SPK=223;
|
||||||
|
if(PROP[RUG] != 2) return(2011);
|
||||||
|
OLDLC2=OLDLOC;
|
||||||
|
OLDLOC=LOC;
|
||||||
|
NEWLOC=PLACE[RUG]+FIXED[RUG]-LOC;
|
||||||
|
SPK=226;
|
||||||
|
if(PROP[SAPPH] >= 0)SPK=227;
|
||||||
|
RSPEAK(SPK);
|
||||||
|
return(2);
|
||||||
|
|
||||||
|
/* LISTEN. INTRANSITIVE ONLY. PRINT STUFF BASED ON OBJSND/LOCSND. */
|
||||||
|
|
||||||
|
L8330: SPK=228;
|
||||||
|
K=LOCSND[LOC];
|
||||||
|
if(K == 0) goto L8332;
|
||||||
|
RSPEAK(IABS(K));
|
||||||
|
if(K < 0) return(2012);
|
||||||
|
SPK=0;
|
||||||
|
L8332: SETPRM(1,ZZWORD-MESH*2,0);
|
||||||
|
/* 8335 */ for (I=1; I<=100; I++) {
|
||||||
|
if(!HERE(I) || OBJSND[I] == 0 || PROP[I] < 0) goto L8335;
|
||||||
|
PSPEAK(I,OBJSND[I]+PROP[I]);
|
||||||
|
SPK=0;
|
||||||
|
if(I == BIRD && OBJSND[I]+PROP[I] == 8)DSTROY(BIRD);
|
||||||
|
L8335: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* Z'ZZZ (WORD GETS RECOMPUTED AT STARTUP; DIFFERENT EACH GAME). */
|
||||||
|
|
||||||
|
L8340: if(!AT(RESER) && LOC != FIXED[RESER]-1) return(2011);
|
||||||
|
PSPEAK(RESER,PROP[RESER]+1);
|
||||||
|
PROP[RESER]=1-PROP[RESER];
|
||||||
|
if(AT(RESER)) return(2012);
|
||||||
|
OLDLC2=LOC;
|
||||||
|
NEWLOC=0;
|
||||||
|
RSPEAK(241);
|
||||||
|
return(2);
|
||||||
|
|
||||||
|
}
|
||||||
352
actions2.c
Normal file
352
actions2.c
Normal file
|
|
@ -0,0 +1,352 @@
|
||||||
|
#include "misc.h"
|
||||||
|
#include "main.h"
|
||||||
|
#include "share.h"
|
||||||
|
#include "funcs.h"
|
||||||
|
|
||||||
|
#define TRUE (0==0)
|
||||||
|
#define FALSE (0!=0)
|
||||||
|
|
||||||
|
/* CARRY AN OBJECT. SPECIAL CASES FOR BIRD AND CAGE (IF BIRD IN CAGE, CAN'T
|
||||||
|
* TAKE ONE WITHOUT THE OTHER). LIQUIDS ALSO SPECIAL, SINCE THEY DEPEND ON
|
||||||
|
* STATUS OF BOTTLE. ALSO VARIOUS SIDE EFFECTS, ETC. */
|
||||||
|
|
||||||
|
carry() {
|
||||||
|
if(TOTING(OBJ)) return(2011);
|
||||||
|
SPK=25;
|
||||||
|
if(OBJ == PLANT && PROP[PLANT] <= 0)SPK=115;
|
||||||
|
if(OBJ == BEAR && PROP[BEAR] == 1)SPK=169;
|
||||||
|
if(OBJ == CHAIN && PROP[BEAR] != 0)SPK=170;
|
||||||
|
if(OBJ == URN)SPK=215;
|
||||||
|
if(OBJ == CAVITY)SPK=217;
|
||||||
|
if(OBJ == BLOOD)SPK=239;
|
||||||
|
if(OBJ == RUG && PROP[RUG] == 2)SPK=222;
|
||||||
|
if(OBJ == SIGN)SPK=196;
|
||||||
|
if(OBJ != MESSAG) goto L9011;
|
||||||
|
SPK=190;
|
||||||
|
DSTROY(MESSAG);
|
||||||
|
L9011: if(FIXED[OBJ] != 0) return(2011);
|
||||||
|
if(OBJ != WATER && OBJ != OIL) goto L9017;
|
||||||
|
K=OBJ;
|
||||||
|
OBJ=BOTTLE;
|
||||||
|
if(HERE(BOTTLE) && LIQ(0) == K) goto L9017;
|
||||||
|
if(TOTING(BOTTLE) && PROP[BOTTLE] == 1) return(fill());
|
||||||
|
if(PROP[BOTTLE] != 1)SPK=105;
|
||||||
|
if(!TOTING(BOTTLE))SPK=104;
|
||||||
|
return(2011);
|
||||||
|
L9017: SPK=92;
|
||||||
|
if(HOLDNG >= 7) return(2011);
|
||||||
|
if(OBJ != BIRD || PROP[BIRD] == 1 || -1-PROP[BIRD] == 1) goto L9014;
|
||||||
|
if(PROP[BIRD] == 2) goto L9015;
|
||||||
|
if(!TOTING(CAGE))SPK=27;
|
||||||
|
if(TOTING(ROD))SPK=26;
|
||||||
|
if(SPK/2 == 13) return(2011);
|
||||||
|
PROP[BIRD]=1;
|
||||||
|
L9014: if((OBJ == BIRD || OBJ == CAGE) && (PROP[BIRD] == 1 || -1-PROP[BIRD] ==
|
||||||
|
1))CARRY(BIRD+CAGE-OBJ,LOC);
|
||||||
|
CARRY(OBJ,LOC);
|
||||||
|
K=LIQ(0);
|
||||||
|
if(OBJ == BOTTLE && K != 0)PLACE[K]= -1;
|
||||||
|
if(!GSTONE(OBJ) || PROP[OBJ] == 0) return(2009);
|
||||||
|
PROP[OBJ]=0;
|
||||||
|
PROP[CAVITY]=1;
|
||||||
|
return(2009);
|
||||||
|
|
||||||
|
L9015: SPK=238;
|
||||||
|
DSTROY(BIRD);
|
||||||
|
return(2011);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* DISCARD OBJECT. "THROW" ALSO COMES HERE FOR MOST OBJECTS. SPECIAL CASES FOR
|
||||||
|
* BIRD (MIGHT ATTACK SNAKE OR DRAGON) AND CAGE (MIGHT CONTAIN BIRD) AND VASE.
|
||||||
|
* DROP COINS AT VENDING MACHINE FOR EXTRA BATTERIES. */
|
||||||
|
|
||||||
|
discard(just_do_it)long just_do_it; {
|
||||||
|
if(just_do_it) goto L9021;
|
||||||
|
if(TOTING(ROD2) && OBJ == ROD && !TOTING(ROD))OBJ=ROD2;
|
||||||
|
if(!TOTING(OBJ)) return(2011);
|
||||||
|
if(OBJ != BIRD || !HERE(SNAKE)) goto L9023;
|
||||||
|
RSPEAK(30);
|
||||||
|
if(CLOSED) return(19000);
|
||||||
|
DSTROY(SNAKE);
|
||||||
|
/* SET PROP FOR USE BY TRAVEL OPTIONS */
|
||||||
|
PROP[SNAKE]=1;
|
||||||
|
L9021: K=LIQ(0);
|
||||||
|
if(K == OBJ)OBJ=BOTTLE;
|
||||||
|
if(OBJ == BOTTLE && K != 0)PLACE[K]=0;
|
||||||
|
if(OBJ == CAGE && PROP[BIRD] == 1)DROP(BIRD,LOC);
|
||||||
|
DROP(OBJ,LOC);
|
||||||
|
if(OBJ != BIRD) return(2012);
|
||||||
|
PROP[BIRD]=0;
|
||||||
|
if(FOREST(LOC))PROP[BIRD]=2;
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9023: if(!(GSTONE(OBJ) && AT(CAVITY) && PROP[CAVITY] != 0)) goto L9024;
|
||||||
|
RSPEAK(218);
|
||||||
|
PROP[OBJ]=1;
|
||||||
|
PROP[CAVITY]=0;
|
||||||
|
if(!HERE(RUG) || !((OBJ == EMRALD && PROP[RUG] != 2) || (OBJ == RUBY &&
|
||||||
|
PROP[RUG] == 2))) goto L9021;
|
||||||
|
SPK=219;
|
||||||
|
if(TOTING(RUG))SPK=220;
|
||||||
|
if(OBJ == RUBY)SPK=221;
|
||||||
|
RSPEAK(SPK);
|
||||||
|
if(SPK == 220) goto L9021;
|
||||||
|
K=2-PROP[RUG];
|
||||||
|
PROP[RUG]=K;
|
||||||
|
if(K == 2)K=PLAC[SAPPH];
|
||||||
|
MOVE(RUG+100,K);
|
||||||
|
goto L9021;
|
||||||
|
|
||||||
|
L9024: if(OBJ != COINS || !HERE(VEND)) goto L9025;
|
||||||
|
DSTROY(COINS);
|
||||||
|
DROP(BATTER,LOC);
|
||||||
|
PSPEAK(BATTER,0);
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9025: if(OBJ != BIRD || !AT(DRAGON) || PROP[DRAGON] != 0) goto L9026;
|
||||||
|
RSPEAK(154);
|
||||||
|
DSTROY(BIRD);
|
||||||
|
PROP[BIRD]=0;
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9026: if(OBJ != BEAR || !AT(TROLL)) goto L9027;
|
||||||
|
RSPEAK(163);
|
||||||
|
MOVE(TROLL,0);
|
||||||
|
MOVE(TROLL+100,0);
|
||||||
|
MOVE(TROLL2,PLAC[TROLL]);
|
||||||
|
MOVE(TROLL2+100,FIXD[TROLL]);
|
||||||
|
JUGGLE(CHASM);
|
||||||
|
PROP[TROLL]=2;
|
||||||
|
goto L9021;
|
||||||
|
|
||||||
|
L9027: if(OBJ == VASE && LOC != PLAC[PILLOW]) goto L9028;
|
||||||
|
RSPEAK(54);
|
||||||
|
goto L9021;
|
||||||
|
|
||||||
|
L9028: PROP[VASE]=2;
|
||||||
|
if(AT(PILLOW))PROP[VASE]=0;
|
||||||
|
PSPEAK(VASE,PROP[VASE]+1);
|
||||||
|
if(PROP[VASE] != 0)FIXED[VASE]= -1;
|
||||||
|
goto L9021;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* ATTACK. ASSUME TARGET IF UNAMBIGUOUS. "THROW" ALSO LINKS HERE. ATTACKABLE
|
||||||
|
* OBJECTS FALL INTO TWO CATEGORIES: ENEMIES (SNAKE, DWARF, ETC.) AND OTHERS
|
||||||
|
* (BIRD, CLAM, MACHINE). AMBIGUOUS IF 2 ENEMIES, OR NO ENEMIES BUT 2 OTHERS. */
|
||||||
|
|
||||||
|
attack() {
|
||||||
|
I=ATDWRF(LOC);
|
||||||
|
if(OBJ != 0) goto L9124;
|
||||||
|
if(I > 0)OBJ=DWARF;
|
||||||
|
if(HERE(SNAKE))OBJ=OBJ*100+SNAKE;
|
||||||
|
if(AT(DRAGON) && PROP[DRAGON] == 0)OBJ=OBJ*100+DRAGON;
|
||||||
|
if(AT(TROLL))OBJ=OBJ*100+TROLL;
|
||||||
|
if(AT(OGRE))OBJ=OBJ*100+OGRE;
|
||||||
|
if(HERE(BEAR) && PROP[BEAR] == 0)OBJ=OBJ*100+BEAR;
|
||||||
|
if(OBJ > 100) return(8000);
|
||||||
|
if(OBJ != 0) goto L9124;
|
||||||
|
/* CAN'T ATTACK BIRD OR MACHINE BY THROWING AXE. */
|
||||||
|
if(HERE(BIRD) && VERB != THROW)OBJ=BIRD;
|
||||||
|
if(HERE(VEND) && VERB != THROW)OBJ=OBJ*100+VEND;
|
||||||
|
/* CLAM AND OYSTER BOTH TREATED AS CLAM FOR INTRANSITIVE CASE; NO HARM DONE. */
|
||||||
|
if(HERE(CLAM) || HERE(OYSTER))OBJ=100*OBJ+CLAM;
|
||||||
|
if(OBJ > 100) return(8000);
|
||||||
|
L9124: if(OBJ != BIRD) goto L9125;
|
||||||
|
SPK=137;
|
||||||
|
if(CLOSED) return(2011);
|
||||||
|
DSTROY(BIRD);
|
||||||
|
PROP[BIRD]=0;
|
||||||
|
SPK=45;
|
||||||
|
L9125: if(OBJ != VEND) goto L9126;
|
||||||
|
PSPEAK(VEND,PROP[VEND]+2);
|
||||||
|
PROP[VEND]=3-PROP[VEND];
|
||||||
|
return(2012);
|
||||||
|
|
||||||
|
L9126: if(OBJ == 0)SPK=44;
|
||||||
|
if(OBJ == CLAM || OBJ == OYSTER)SPK=150;
|
||||||
|
if(OBJ == SNAKE)SPK=46;
|
||||||
|
if(OBJ == DWARF)SPK=49;
|
||||||
|
if(OBJ == DWARF && CLOSED) return(19000);
|
||||||
|
if(OBJ == DRAGON)SPK=167;
|
||||||
|
if(OBJ == TROLL)SPK=157;
|
||||||
|
if(OBJ == OGRE)SPK=203;
|
||||||
|
if(OBJ == OGRE && I > 0) goto L9128;
|
||||||
|
if(OBJ == BEAR)SPK=165+(PROP[BEAR]+1)/2;
|
||||||
|
if(OBJ != DRAGON || PROP[DRAGON] != 0) return(2011);
|
||||||
|
/* FUN STUFF FOR DRAGON. IF HE INSISTS ON ATTACKING IT, WIN! SET PROP TO DEAD,
|
||||||
|
* MOVE DRAGON TO CENTRAL LOC (STILL FIXED), MOVE RUG THERE (NOT FIXED), AND
|
||||||
|
* MOVE HIM THERE, TOO. THEN DO A NULL MOTION TO GET NEW DESCRIPTION. */
|
||||||
|
RSPEAK(49);
|
||||||
|
VERB=0;
|
||||||
|
OBJ=0;
|
||||||
|
GETIN(WD1,WD1X,WD2,WD2X);
|
||||||
|
if(WD1 != MAKEWD(25) && WD1 != MAKEWD(250519)) return(2607);
|
||||||
|
PSPEAK(DRAGON,3);
|
||||||
|
PROP[DRAGON]=1;
|
||||||
|
PROP[RUG]=0;
|
||||||
|
K=(PLAC[DRAGON]+FIXD[DRAGON])/2;
|
||||||
|
MOVE(DRAGON+100,-1);
|
||||||
|
MOVE(RUG+100,0);
|
||||||
|
MOVE(DRAGON,K);
|
||||||
|
MOVE(RUG,K);
|
||||||
|
DROP(BLOOD,K);
|
||||||
|
/* 9127 */ for (OBJ=1; OBJ<=100; OBJ++) {
|
||||||
|
if(PLACE[OBJ] == PLAC[DRAGON] || PLACE[OBJ] == FIXD[DRAGON])MOVE(OBJ,K);
|
||||||
|
L9127: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
LOC=K;
|
||||||
|
K=NUL;
|
||||||
|
return(8);
|
||||||
|
|
||||||
|
L9128: RSPEAK(SPK);
|
||||||
|
RSPEAK(6);
|
||||||
|
DSTROY(OGRE);
|
||||||
|
K=0;
|
||||||
|
/* 9129 */ for (I=1; I<=5; I++) {
|
||||||
|
if(DLOC[I] != LOC) goto L9129;
|
||||||
|
K=K+1;
|
||||||
|
DLOC[I]=61;
|
||||||
|
DSEEN[I]=FALSE;
|
||||||
|
L9129: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
SPK=SPK+1+1/K;
|
||||||
|
return(2011);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* THROW. SAME AS DISCARD UNLESS AXE. THEN SAME AS ATTACK EXCEPT IGNORE BIRD,
|
||||||
|
* AND IF DWARF IS PRESENT THEN ONE MIGHT BE KILLED. (ONLY WAY TO DO SO!)
|
||||||
|
* AXE ALSO SPECIAL FOR DRAGON, BEAR, AND TROLL. TREASURES SPECIAL FOR TROLL. */
|
||||||
|
|
||||||
|
throw() {
|
||||||
|
if(TOTING(ROD2) && OBJ == ROD && !TOTING(ROD))OBJ=ROD2;
|
||||||
|
if(!TOTING(OBJ)) return(2011);
|
||||||
|
if(OBJ >= 50 && OBJ <= MAXTRS && AT(TROLL)) goto L9178;
|
||||||
|
if(OBJ == FOOD && HERE(BEAR)) goto L9177;
|
||||||
|
if(OBJ != AXE) return(discard(FALSE));
|
||||||
|
I=ATDWRF(LOC);
|
||||||
|
if(I > 0) goto L9172;
|
||||||
|
SPK=152;
|
||||||
|
if(AT(DRAGON) && PROP[DRAGON] == 0) goto L9175;
|
||||||
|
SPK=158;
|
||||||
|
if(AT(TROLL)) goto L9175;
|
||||||
|
SPK=203;
|
||||||
|
if(AT(OGRE)) goto L9175;
|
||||||
|
if(HERE(BEAR) && PROP[BEAR] == 0) goto L9176;
|
||||||
|
OBJ=0;
|
||||||
|
return(attack());
|
||||||
|
|
||||||
|
L9172: SPK=48;
|
||||||
|
if(RAN(7) < DFLAG) goto L9175;
|
||||||
|
DSEEN[I]=FALSE;
|
||||||
|
DLOC[I]=0;
|
||||||
|
SPK=47;
|
||||||
|
DKILL=DKILL+1;
|
||||||
|
if(DKILL == 1)SPK=149;
|
||||||
|
L9175: RSPEAK(SPK);
|
||||||
|
DROP(AXE,LOC);
|
||||||
|
K=NUL;
|
||||||
|
return(8);
|
||||||
|
|
||||||
|
/* THIS'LL TEACH HIM TO THROW THE AXE AT THE BEAR! */
|
||||||
|
L9176: SPK=164;
|
||||||
|
DROP(AXE,LOC);
|
||||||
|
FIXED[AXE]= -1;
|
||||||
|
PROP[AXE]=1;
|
||||||
|
JUGGLE(BEAR);
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
/* BUT THROWING FOOD IS ANOTHER STORY. */
|
||||||
|
L9177: OBJ=BEAR;
|
||||||
|
return(feed());
|
||||||
|
|
||||||
|
L9178: SPK=159;
|
||||||
|
/* SNARF A TREASURE FOR THE TROLL. */
|
||||||
|
DROP(OBJ,0);
|
||||||
|
MOVE(TROLL,0);
|
||||||
|
MOVE(TROLL+100,0);
|
||||||
|
DROP(TROLL2,PLAC[TROLL]);
|
||||||
|
DROP(TROLL2+100,FIXD[TROLL]);
|
||||||
|
JUGGLE(CHASM);
|
||||||
|
return(2011);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* FEED. IF BIRD, NO SEED. SNAKE, DRAGON, TROLL: QUIP. IF DWARF, MAKE HIM
|
||||||
|
* MAD. BEAR, SPECIAL. */
|
||||||
|
|
||||||
|
feed() {
|
||||||
|
if(OBJ != BIRD) goto L9212;
|
||||||
|
SPK=100;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9212: if(OBJ != SNAKE && OBJ != DRAGON && OBJ != TROLL) goto L9213;
|
||||||
|
SPK=102;
|
||||||
|
if(OBJ == DRAGON && PROP[DRAGON] != 0)SPK=110;
|
||||||
|
if(OBJ == TROLL)SPK=182;
|
||||||
|
if(OBJ != SNAKE || CLOSED || !HERE(BIRD)) return(2011);
|
||||||
|
SPK=101;
|
||||||
|
DSTROY(BIRD);
|
||||||
|
PROP[BIRD]=0;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9213: if(OBJ != DWARF) goto L9214;
|
||||||
|
if(!HERE(FOOD)) return(2011);
|
||||||
|
SPK=103;
|
||||||
|
DFLAG=DFLAG+2;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9214: if(OBJ != BEAR) goto L9215;
|
||||||
|
if(PROP[BEAR] == 0)SPK=102;
|
||||||
|
if(PROP[BEAR] == 3)SPK=110;
|
||||||
|
if(!HERE(FOOD)) return(2011);
|
||||||
|
DSTROY(FOOD);
|
||||||
|
PROP[BEAR]=1;
|
||||||
|
FIXED[AXE]=0;
|
||||||
|
PROP[AXE]=0;
|
||||||
|
SPK=168;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9215: if(OBJ != OGRE) goto L9216;
|
||||||
|
if(HERE(FOOD))SPK=202;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9216: SPK=14;
|
||||||
|
return(2011);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* FILL. BOTTLE OR URN MUST BE EMPTY, AND LIQUID AVAILABLE. (VASE IS NASTY.) */
|
||||||
|
|
||||||
|
fill() {
|
||||||
|
if(OBJ == VASE) goto L9222;
|
||||||
|
if(OBJ == URN) goto L9224;
|
||||||
|
if(OBJ != 0 && OBJ != BOTTLE) return(2011);
|
||||||
|
if(OBJ == 0 && !HERE(BOTTLE)) return(8000);
|
||||||
|
SPK=107;
|
||||||
|
if(LIQLOC(LOC) == 0)SPK=106;
|
||||||
|
if(HERE(URN) && PROP[URN] != 0)SPK=214;
|
||||||
|
if(LIQ(0) != 0)SPK=105;
|
||||||
|
if(SPK != 107) return(2011);
|
||||||
|
PROP[BOTTLE]=MOD(COND[LOC],4)/2*2;
|
||||||
|
K=LIQ(0);
|
||||||
|
if(TOTING(BOTTLE))PLACE[K]= -1;
|
||||||
|
if(K == OIL)SPK=108;
|
||||||
|
return(2011);
|
||||||
|
|
||||||
|
L9222: SPK=29;
|
||||||
|
if(LIQLOC(LOC) == 0)SPK=144;
|
||||||
|
if(LIQLOC(LOC) == 0 || !TOTING(VASE)) return(2011);
|
||||||
|
RSPEAK(145);
|
||||||
|
PROP[VASE]=2;
|
||||||
|
FIXED[VASE]= -1;
|
||||||
|
return(discard(TRUE));
|
||||||
|
|
||||||
|
L9224: SPK=213;
|
||||||
|
if(PROP[URN] != 0) return(2011);
|
||||||
|
SPK=144;
|
||||||
|
K=LIQ(0);
|
||||||
|
if(K == 0 || !HERE(BOTTLE)) return(2011);
|
||||||
|
PLACE[K]=0;
|
||||||
|
PROP[BOTTLE]=1;
|
||||||
|
if(K == OIL)PROP[URN]=1;
|
||||||
|
SPK=211+PROP[URN];
|
||||||
|
return(2011);
|
||||||
|
}
|
||||||
2295
adventure.text
Normal file
2295
adventure.text
Normal file
File diff suppressed because it is too large
Load diff
6
copyright
Normal file
6
copyright
Normal file
|
|
@ -0,0 +1,6 @@
|
||||||
|
Don Wood's Adventure 2.5: (c) Copyright 1995 by Donald R. Woods.
|
||||||
|
|
||||||
|
This software may be freely redistributed if this notice is retained.
|
||||||
|
(The author apologises for the style of the code; it is a result of
|
||||||
|
running the original Fortran IV source through a home-brew Fortran-to-C
|
||||||
|
converter.)
|
||||||
50
datime.c
Normal file
50
datime.c
Normal file
|
|
@ -0,0 +1,50 @@
|
||||||
|
#ifdef AMIGA
|
||||||
|
#define _TIME_
|
||||||
|
#include "exec/types.h"
|
||||||
|
#include "intuition/intuition.h"
|
||||||
|
|
||||||
|
#define INTUITIONREV 1
|
||||||
|
|
||||||
|
struct IntuitionBase *IntuitionBase = NULL;
|
||||||
|
|
||||||
|
fDATIME(X,Y)int *X, *Y; {
|
||||||
|
static int GOTX = 0, GOTY;
|
||||||
|
if(GOTX == 0) {
|
||||||
|
IntuitionBase = (struct IntuitionBase *)
|
||||||
|
OpenLibrary("intuition.library", INTUITIONREV);
|
||||||
|
if (IntuitionBase == NULL) {
|
||||||
|
printf("Can't open library.\n");
|
||||||
|
exit(FALSE);
|
||||||
|
}
|
||||||
|
CurrentTime(&GOTX, &GOTY);
|
||||||
|
CloseLibrary(IntuitionBase);
|
||||||
|
}
|
||||||
|
GOTY += 654321;
|
||||||
|
if(GOTY >= 1000000) {GOTX += 1; GOTY -= 1000000;}
|
||||||
|
*X = GOTX;
|
||||||
|
*Y = GOTY;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef __MSDOS__
|
||||||
|
#define _TIME_
|
||||||
|
#include "time.h"
|
||||||
|
|
||||||
|
fDATIME(X,Y)long *X, *Y; {
|
||||||
|
time(X); time(Y);
|
||||||
|
*Y /= 2;
|
||||||
|
/* it would be even better if the two numbers were totally
|
||||||
|
* unrelated, like if 'time' returned 64 bits of data */
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef _TIME_
|
||||||
|
#include "sys/time.h"
|
||||||
|
|
||||||
|
fDATIME(X,Y)long *X, *Y; {
|
||||||
|
struct timeval now;
|
||||||
|
gettimeofday(&now, 0);
|
||||||
|
*X = now.tv_sec;
|
||||||
|
*Y = now.tv_usec;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
40
funcs.h
Normal file
40
funcs.h
Normal file
|
|
@ -0,0 +1,40 @@
|
||||||
|
/* STATEMENT FUNCTIONS
|
||||||
|
*
|
||||||
|
* AT(OBJ) = TRUE IF ON EITHER SIDE OF TWO-PLACED OBJECT
|
||||||
|
* CNDBIT(L,N) = TRUE IF COND(L) HAS BIT N SET (BIT 0 IS UNITS BIT)
|
||||||
|
* DARK(DUMMY) = TRUE IF LOCATION "LOC" IS DARK
|
||||||
|
* FORCED(LOC) = TRUE IF LOC MOVES WITHOUT ASKING FOR INPUT (COND=2)
|
||||||
|
* FOREST(LOC) = TRUE IF LOC IS PART OF THE FOREST
|
||||||
|
* GSTONE(OBJ) = TRUE IF OBJ IS A GEMSTONE
|
||||||
|
* HERE(OBJ) = TRUE IF THE OBJ IS AT "LOC" (OR IS BEING CARRIED)
|
||||||
|
* LIQ(DUMMY) = OBJECT NUMBER OF LIQUID IN BOTTLE
|
||||||
|
* LIQLOC(LOC) = OBJECT NUMBER OF LIQUID (IF ANY) AT LOC
|
||||||
|
* PCT(N) = TRUE N% OF THE TIME (N INTEGER FROM 0 TO 100)
|
||||||
|
* TOTING(OBJ) = TRUE IF THE OBJ IS BEING CARRIED */
|
||||||
|
|
||||||
|
#define TOTING(OBJ) (PLACE[OBJ] == -1)
|
||||||
|
#define AT(OBJ) (PLACE[OBJ] == LOC || FIXED[OBJ] == LOC)
|
||||||
|
#define HERE(OBJ) (AT(OBJ) || TOTING(OBJ))
|
||||||
|
#define LIQ2(PBOTL) ((1-(PBOTL))*WATER+((PBOTL)/2)*(WATER+OIL))
|
||||||
|
#define LIQ(DUMMY) (LIQ2(PROP[BOTTLE]<0 ? -1-PROP[BOTTLE] : PROP[BOTTLE]))
|
||||||
|
#define LIQLOC(LOC) (LIQ2((MOD(COND[LOC]/2*2,8)-5)*MOD(COND[LOC]/4,2)+1))
|
||||||
|
#define CNDBIT(L,N) (TSTBIT(COND[L],N))
|
||||||
|
#define FORCED(LOC) (COND[LOC] == 2)
|
||||||
|
#define DARK(DUMMY) ((!CNDBIT(LOC,0)) && (PROP[LAMP] == 0 || !HERE(LAMP)))
|
||||||
|
#define PCT(N) (RAN(100) < (N))
|
||||||
|
#define GSTONE(OBJ) ((OBJ) == EMRALD || (OBJ) == RUBY || (OBJ) == AMBER || (OBJ) == SAPPH)
|
||||||
|
#define FOREST(LOC) ((LOC) >= 145 && (LOC) <= 166)
|
||||||
|
#define VOCWRD(LETTRS,SECT) (VOCAB(MAKEWD(LETTRS),SECT))
|
||||||
|
|
||||||
|
/* THE FOLLOWING TWO FUNCTIONS WERE ADDED TO FIX A BUG (CLOCK1 DECREMENTED
|
||||||
|
* WHILE IN FOREST). THEY SHOULD PROBABLY BE REPLACED BY USING ANOTHER
|
||||||
|
* "COND" BIT. FOR NOW, HOWEVER, A QUICK FIX... OUTSID(LOC) IS TRUE IF
|
||||||
|
* LOC IS OUTSIDE, INDEEP(LOC) IS TRUE IF LOC IS "DEEP" IN THE CAVE (HALL
|
||||||
|
* OF MISTS OR DEEPER). NOTE SPECIAL KLUDGES FOR "FOOF" LOCS. */
|
||||||
|
|
||||||
|
#define OUTSID(LOC) ((LOC) <= 8 || FOREST(LOC) || (LOC) == PLAC[SAPPH] || (LOC) == 180 || (LOC) == 182)
|
||||||
|
#define INDEEP(LOC) ((LOC) >= 15 && !OUTSID(LOC) && (LOC) != 179)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
708
init.c
Normal file
708
init.c
Normal file
|
|
@ -0,0 +1,708 @@
|
||||||
|
#include "misc.h"
|
||||||
|
#include "main.h"
|
||||||
|
#include "share.h"
|
||||||
|
#include "funcs.h"
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
#define TRUE (0==0)
|
||||||
|
#define FALSE (0!=0)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* INITIALISATION
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* CURRENT LIMITS:
|
||||||
|
* 12500 WORDS OF MESSAGE TEXT (LINES, LINSIZ).
|
||||||
|
* 885 TRAVEL OPTIONS (TRAVEL, TRVSIZ).
|
||||||
|
* 330 VOCABULARY WORDS (KTAB, ATAB, TABSIZ).
|
||||||
|
* 185 LOCATIONS (LTEXT, STEXT, KEY, COND, ABB, ATLOC, LOCSND, LOCSIZ).
|
||||||
|
* 100 OBJECTS (PLAC, PLACE, FIXD, FIXED, LINK (TWICE), PTEXT, PROP,
|
||||||
|
* OBJSND, OBJTXT).
|
||||||
|
* 35 "ACTION" VERBS (ACTSPK, VRBSIZ).
|
||||||
|
* 277 RANDOM MESSAGES (RTEXT, RTXSIZ).
|
||||||
|
* 12 DIFFERENT PLAYER CLASSIFICATIONS (CTEXT, CVAL, CLSMAX).
|
||||||
|
* 20 HINTS (HINTLC, HINTED, HINTS, HNTSIZ).
|
||||||
|
* 5 "# OF TURNS" THRESHHOLDS (TTEXT, TRNVAL, TRNSIZ).
|
||||||
|
* THERE ARE ALSO LIMITS WHICH CANNOT BE EXCEEDED DUE TO THE STRUCTURE OF
|
||||||
|
* THE DATABASE. (E.G., THE VOCABULARY USES N/1000 TO DETERMINE WORD TYPE,
|
||||||
|
* SO THERE CAN'T BE MORE THAN 1000 WORDS.) THESE UPPER LIMITS ARE:
|
||||||
|
* 1000 NON-SYNONYMOUS VOCABULARY WORDS
|
||||||
|
* 300 LOCATIONS
|
||||||
|
* 100 OBJECTS */
|
||||||
|
|
||||||
|
|
||||||
|
/* DESCRIPTION OF THE DATABASE FORMAT
|
||||||
|
*
|
||||||
|
*
|
||||||
|
* THE DATA FILE CONTAINS SEVERAL SECTIONS. EACH BEGINS WITH A LINE CONTAINING
|
||||||
|
* A NUMBER IDENTIFYING THE SECTION, AND ENDS WITH A LINE CONTAINING "-1".
|
||||||
|
*
|
||||||
|
* SECTION 1: LONG FORM DESCRIPTIONS. EACH LINE CONTAINS A LOCATION NUMBER,
|
||||||
|
* A TAB, AND A LINE OF TEXT. THE SET OF (NECESSARILY ADJACENT) LINES
|
||||||
|
* WHOSE NUMBERS ARE X FORM THE LONG DESCRIPTION OF LOCATION X.
|
||||||
|
* SECTION 2: SHORT FORM DESCRIPTIONS. SAME FORMAT AS LONG FORM. NOT ALL
|
||||||
|
* PLACES HAVE SHORT DESCRIPTIONS.
|
||||||
|
* SECTION 3: TRAVEL TABLE. EACH LINE CONTAINS A LOCATION NUMBER (X), A SECOND
|
||||||
|
* LOCATION NUMBER (Y), AND A LIST OF MOTION NUMBERS (SEE SECTION 4).
|
||||||
|
* EACH MOTION REPRESENTS A VERB WHICH WILL GO TO Y IF CURRENTLY AT X.
|
||||||
|
* Y, IN TURN, IS INTERPRETED AS FOLLOWS. LET M=Y/1000, N=Y MOD 1000.
|
||||||
|
* IF N<=300 IT IS THE LOCATION TO GO TO.
|
||||||
|
* IF 300<N<=500 N-300 IS USED IN A COMPUTED GOTO TO
|
||||||
|
* A SECTION OF SPECIAL CODE.
|
||||||
|
* IF N>500 MESSAGE N-500 FROM SECTION 6 IS PRINTED,
|
||||||
|
* AND HE STAYS WHEREVER HE IS.
|
||||||
|
* MEANWHILE, M SPECIFIES THE CONDITIONS ON THE MOTION.
|
||||||
|
* IF M=0 IT'S UNCONDITIONAL.
|
||||||
|
* IF 0<M<100 IT IS DONE WITH M% PROBABILITY.
|
||||||
|
* IF M=100 UNCONDITIONAL, BUT FORBIDDEN TO DWARVES.
|
||||||
|
* IF 100<M<=200 HE MUST BE CARRYING OBJECT M-100.
|
||||||
|
* IF 200<M<=300 MUST BE CARRYING OR IN SAME ROOM AS M-200.
|
||||||
|
* IF 300<M<=400 PROP(M MOD 100) MUST *NOT* BE 0.
|
||||||
|
* IF 400<M<=500 PROP(M MOD 100) MUST *NOT* BE 1.
|
||||||
|
* IF 500<M<=600 PROP(M MOD 100) MUST *NOT* BE 2, ETC.
|
||||||
|
* IF THE CONDITION (IF ANY) IS NOT MET, THEN THE NEXT *DIFFERENT*
|
||||||
|
* "DESTINATION" VALUE IS USED (UNLESS IT FAILS TO MEET *ITS* CONDITIONS,
|
||||||
|
* IN WHICH CASE THE NEXT IS FOUND, ETC.). TYPICALLY, THE NEXT DEST WILL
|
||||||
|
* BE FOR ONE OF THE SAME VERBS, SO THAT ITS ONLY USE IS AS THE ALTERNATE
|
||||||
|
* DESTINATION FOR THOSE VERBS. FOR INSTANCE:
|
||||||
|
* 15 110022 29 31 34 35 23 43
|
||||||
|
* 15 14 29
|
||||||
|
* THIS SAYS THAT, FROM LOC 15, ANY OF THE VERBS 29, 31, ETC., WILL TAKE
|
||||||
|
* HIM TO 22 IF HE'S CARRYING OBJECT 10, AND OTHERWISE WILL GO TO 14.
|
||||||
|
* 11 303008 49
|
||||||
|
* 11 9 50
|
||||||
|
* THIS SAYS THAT, FROM 11, 49 TAKES HIM TO 8 UNLESS PROP(3)=0, IN WHICH
|
||||||
|
* CASE HE GOES TO 9. VERB 50 TAKES HIM TO 9 REGARDLESS OF PROP(3).
|
||||||
|
* SECTION 4: VOCABULARY. EACH LINE CONTAINS A NUMBER (N), A TAB, AND A
|
||||||
|
* FIVE-LETTER WORD. CALL M=N/1000. IF M=0, THEN THE WORD IS A MOTION
|
||||||
|
* VERB FOR USE IN TRAVELLING (SEE SECTION 3). ELSE, IF M=1, THE WORD IS
|
||||||
|
* AN OBJECT. ELSE, IF M=2, THE WORD IS AN ACTION VERB (SUCH AS "CARRY"
|
||||||
|
* OR "ATTACK"). ELSE, IF M=3, THE WORD IS A SPECIAL CASE VERB (SUCH AS
|
||||||
|
* "DIG") AND N MOD 1000 IS AN INDEX INTO SECTION 6. OBJECTS FROM 50 TO
|
||||||
|
* (CURRENTLY, ANYWAY) 79 ARE CONSIDERED TREASURES (FOR PIRATE, CLOSEOUT).
|
||||||
|
* SECTION 5: OBJECT DESCRIPTIONS. EACH LINE CONTAINS A NUMBER (N), A TAB,
|
||||||
|
* AND A MESSAGE. IF N IS FROM 1 TO 100, THE MESSAGE IS THE "INVENTORY"
|
||||||
|
* MESSAGE FOR OBJECT N. OTHERWISE, N SHOULD BE 000, 100, 200, ETC., AND
|
||||||
|
* THE MESSAGE SHOULD BE THE DESCRIPTION OF THE PRECEDING OBJECT WHEN ITS
|
||||||
|
* PROP VALUE IS N/100. THE N/100 IS USED ONLY TO DISTINGUISH MULTIPLE
|
||||||
|
* MESSAGES FROM MULTI-LINE MESSAGES; THE PROP INFO ACTUALLY REQUIRES ALL
|
||||||
|
* MESSAGES FOR AN OBJECT TO BE PRESENT AND CONSECUTIVE. PROPERTIES WHICH
|
||||||
|
* PRODUCE NO MESSAGE SHOULD BE GIVEN THE MESSAGE ">$<".
|
||||||
|
* SECTION 6: ARBITRARY MESSAGES. SAME FORMAT AS SECTIONS 1, 2, AND 5, EXCEPT
|
||||||
|
* THE NUMBERS BEAR NO RELATION TO ANYTHING (EXCEPT FOR SPECIAL VERBS
|
||||||
|
* IN SECTION 4).
|
||||||
|
* SECTION 7: OBJECT LOCATIONS. EACH LINE CONTAINS AN OBJECT NUMBER AND ITS
|
||||||
|
* INITIAL LOCATION (ZERO (OR OMITTED) IF NONE). IF THE OBJECT IS
|
||||||
|
* IMMOVABLE, THE LOCATION IS FOLLOWED BY A "-1". IF IT HAS TWO LOCATIONS
|
||||||
|
* (E.G. THE GRATE) THE FIRST LOCATION IS FOLLOWED WITH THE SECOND, AND
|
||||||
|
* THE OBJECT IS ASSUMED TO BE IMMOVABLE.
|
||||||
|
* SECTION 8: ACTION DEFAULTS. EACH LINE CONTAINS AN "ACTION-VERB" NUMBER AND
|
||||||
|
* THE INDEX (IN SECTION 6) OF THE DEFAULT MESSAGE FOR THE VERB.
|
||||||
|
* SECTION 9: LOCATION ATTRIBUTES. EACH LINE CONTAINS A NUMBER (N) AND UP TO
|
||||||
|
* 20 LOCATION NUMBERS. BIT N (WHERE 0 IS THE UNITS BIT) IS SET IN
|
||||||
|
* COND(LOC) FOR EACH LOC GIVEN. THE COND BITS CURRENTLY ASSIGNED ARE:
|
||||||
|
* 0 LIGHT
|
||||||
|
* 1 IF BIT 2 IS ON: ON FOR OIL, OFF FOR WATER
|
||||||
|
* 2 LIQUID ASSET, SEE BIT 1
|
||||||
|
* 3 PIRATE DOESN'T GO HERE UNLESS FOLLOWING PLAYER
|
||||||
|
* 4 CANNOT USE "BACK" TO MOVE AWAY
|
||||||
|
* BITS PAST 10 INDICATE AREAS OF INTEREST TO "HINT" ROUTINES:
|
||||||
|
* 11 TRYING TO GET INTO CAVE
|
||||||
|
* 12 TRYING TO CATCH BIRD
|
||||||
|
* 13 TRYING TO DEAL WITH SNAKE
|
||||||
|
* 14 LOST IN MAZE
|
||||||
|
* 15 PONDERING DARK ROOM
|
||||||
|
* 16 AT WITT'S END
|
||||||
|
* 17 CLIFF WITH URN
|
||||||
|
* 18 LOST IN FOREST
|
||||||
|
* 19 TRYING TO DEAL WITH OGRE
|
||||||
|
* 20 FOUND ALL TREASURES EXCEPT JADE
|
||||||
|
* COND(LOC) IS SET TO 2, OVERRIDING ALL OTHER BITS, IF LOC HAS FORCED
|
||||||
|
* MOTION.
|
||||||
|
* SECTION 10: CLASS MESSAGES. EACH LINE CONTAINS A NUMBER (N), A TAB, AND A
|
||||||
|
* MESSAGE DESCRIBING A CLASSIFICATION OF PLAYER. THE SCORING SECTION
|
||||||
|
* SELECTS THE APPROPRIATE MESSAGE, WHERE EACH MESSAGE IS CONSIDERED TO
|
||||||
|
* APPLY TO PLAYERS WHOSE SCORES ARE HIGHER THAN THE PREVIOUS N BUT NOT
|
||||||
|
* HIGHER THAN THIS N. NOTE THAT THESE SCORES PROBABLY CHANGE WITH EVERY
|
||||||
|
* MODIFICATION (AND PARTICULARLY EXPANSION) OF THE PROGRAM.
|
||||||
|
* SECTION 11: HINTS. EACH LINE CONTAINS A HINT NUMBER (ADD 10 TO GET COND
|
||||||
|
* BIT; SEE SECTION 9), THE NUMBER OF TURNS HE MUST BE AT THE RIGHT LOC(S)
|
||||||
|
* BEFORE TRIGGERING THE HINT, THE POINTS DEDUCTED FOR TAKING THE HINT,
|
||||||
|
* THE MESSAGE NUMBER (SECTION 6) OF THE QUESTION, AND THE MESSAGE NUMBER
|
||||||
|
* OF THE HINT. THESE VALUES ARE STASHED IN THE "HINTS" ARRAY. HNTMAX IS
|
||||||
|
* SET TO THE MAX HINT NUMBER (<= HNTSIZ).
|
||||||
|
* SECTION 12: UNUSED IN THIS VERSION.
|
||||||
|
* SECTION 13: SOUNDS AND TEXT. EACH LINE CONTAINS EITHER 2 OR 3 NUMBERS. IF
|
||||||
|
* 2 (CALL THEM N AND S), N IS A LOCATION AND MESSAGE ABS(S) FROM SECTION
|
||||||
|
* 6 IS THE SOUND HEARD THERE. IF S<0, THE SOUND THERE DROWNS OUT ALL
|
||||||
|
* OTHER NOISES. IF 3 NUMBERS (CALL THEM N, S, AND T), N IS AN OBJECT
|
||||||
|
* NUMBER AND S+PROP(N) IS THE PROPERTY MESSAGE (FROM SECTION 5) IF HE
|
||||||
|
* LISTENS TO THE OBJECT, AND T+PROP(N) IS THE TEXT IF HE READS IT. IF
|
||||||
|
* S OR T IS -1, THE OBJECT HAS NO SOUND OR TEXT, RESPECTIVELY. NEITHER
|
||||||
|
* S NOR T IS ALLOWED TO BE 0.
|
||||||
|
* SECTION 14: TURN THRESHHOLDS. EACH LINE CONTAINS A NUMBER (N), A TAB, AND
|
||||||
|
* A MESSAGE BERATING THE PLAYER FOR TAKING SO MANY TURNS. THE MESSAGES
|
||||||
|
* MUST BE IN THE PROPER (ASCENDING) ORDER. THE MESSAGE GETS PRINTED IF
|
||||||
|
* THE PLAYER EXCEEDS N MOD 100000 TURNS, AT WHICH TIME N/100000 POINTS
|
||||||
|
* GET DEDUCTED FROM HIS SCORE.
|
||||||
|
* SECTION 0: END OF DATABASE. */
|
||||||
|
|
||||||
|
/* THE VARIOUS MESSAGES (SECTIONS 1, 2, 5, 6, ETC.) MAY INCLUDE CERTAIN
|
||||||
|
* SPECIAL CHARACTER SEQUENCES TO DENOTE THAT THE PROGRAM MUST PROVIDE
|
||||||
|
* PARAMETERS TO INSERT INTO A MESSAGE WHEN THE MESSAGE IS PRINTED. THESE
|
||||||
|
* SEQUENCES ARE:
|
||||||
|
* %S = THE LETTER 'S' OR NOTHING (IF A GIVEN VALUE IS EXACTLY 1)
|
||||||
|
* %W = A WORD (UP TO 10 CHARACTERS)
|
||||||
|
* %L = A WORD MAPPED TO LOWER-CASE LETTERS
|
||||||
|
* %U = A WORD MAPPED TO UPPER-CASE LETTERS
|
||||||
|
* %C = A WORD MAPPED TO LOWER-CASE, FIRST LETTER CAPITALISED
|
||||||
|
* %T = SEVERAL WORDS OF TEXT, ENDING WITH A WORD OF -1
|
||||||
|
* %1 = A 1-DIGIT NUMBER
|
||||||
|
* %2 = A 2-DIGIT NUMBER
|
||||||
|
* ...
|
||||||
|
* %9 = A 9-DIGIT NUMBER
|
||||||
|
* %B = VARIABLE NUMBER OF BLANKS
|
||||||
|
* %! = THE ENTIRE MESSAGE SHOULD BE SUPPRESSED */
|
||||||
|
|
||||||
|
initialise() {
|
||||||
|
printf("Initialising...\n");
|
||||||
|
if(!quick_init()){raw_init(); report(); quick_save();}
|
||||||
|
finish_init();
|
||||||
|
}
|
||||||
|
|
||||||
|
static raw_init() {
|
||||||
|
printf("Couldn't find adventure.data, using adventure.text...\n");
|
||||||
|
|
||||||
|
/* CLEAR OUT THE VARIOUS TEXT-POINTER ARRAYS. ALL TEXT IS STORED IN ARRAY
|
||||||
|
* LINES; EACH LINE IS PRECEDED BY A WORD POINTING TO THE NEXT POINTER (I.E.
|
||||||
|
* THE WORD FOLLOWING THE END OF THE LINE). THE POINTER IS NEGATIVE IF THIS IS
|
||||||
|
* FIRST LINE OF A MESSAGE. THE TEXT-POINTER ARRAYS CONTAIN INDICES OF
|
||||||
|
* POINTER-WORDS IN LINES. STEXT(N) IS SHORT DESCRIPTION OF LOCATION N.
|
||||||
|
* LTEXT(N) IS LONG DESCRIPTION. PTEXT(N) POINTS TO MESSAGE FOR PROP(N)=0.
|
||||||
|
* SUCCESSIVE PROP MESSAGES ARE FOUND BY CHASING POINTERS. RTEXT CONTAINS
|
||||||
|
* SECTION 6'S STUFF. CTEXT(N) POINTS TO A PLAYER-CLASS MESSAGE. TTEXT IS FOR
|
||||||
|
* SECTION 14. WE ALSO CLEAR COND (SEE DESCRIPTION OF SECTION 9 FOR DETAILS). */
|
||||||
|
|
||||||
|
/* 1001 */ for (I=1; I<=300; I++) {
|
||||||
|
if(I <= 100)PTEXT[I]=0;
|
||||||
|
if(I <= RTXSIZ)RTEXT[I]=0;
|
||||||
|
if(I <= CLSMAX)CTEXT[I]=0;
|
||||||
|
if(I <= 100)OBJSND[I]=0;
|
||||||
|
if(I <= 100)OBJTXT[I]=0;
|
||||||
|
if(I > LOCSIZ) goto L1001;
|
||||||
|
STEXT[I]=0;
|
||||||
|
LTEXT[I]=0;
|
||||||
|
COND[I]=0;
|
||||||
|
KEY[I]=0;
|
||||||
|
LOCSND[I]=0;
|
||||||
|
L1001: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
LINUSE=1;
|
||||||
|
TRVS=1;
|
||||||
|
CLSSES=0;
|
||||||
|
TRNVLS=0;
|
||||||
|
|
||||||
|
/* START NEW DATA SECTION. SECT IS THE SECTION NUMBER. */
|
||||||
|
|
||||||
|
L1002: SECT=GETNUM(1);
|
||||||
|
OLDLOC= -1;
|
||||||
|
switch (SECT) { case 0: return(0); case 1: goto L1004; case 2: goto
|
||||||
|
L1004; case 3: goto L1030; case 4: goto L1040; case 5: goto L1004;
|
||||||
|
case 6: goto L1004; case 7: goto L1050; case 8: goto L1060; case
|
||||||
|
9: goto L1070; case 10: goto L1004; case 11: goto L1080; case 12:
|
||||||
|
break; case 13: goto L1090; case 14: goto L1004; }
|
||||||
|
/* (0) (1) (2) (3) (4) (5) (6) (7) (8) (9)
|
||||||
|
* (10) (11) (12) (13) (14) */
|
||||||
|
BUG(9);
|
||||||
|
|
||||||
|
/* SECTIONS 1, 2, 5, 6, 10, 14. READ MESSAGES AND SET UP POINTERS. */
|
||||||
|
|
||||||
|
L1004: KK=LINUSE;
|
||||||
|
L1005: LINUSE=KK;
|
||||||
|
LOC=GETNUM(1);
|
||||||
|
if(LNLENG >= LNPOSN+70)BUG(0);
|
||||||
|
if(LOC == -1) goto L1002;
|
||||||
|
if(LNLENG < LNPOSN)BUG(1);
|
||||||
|
L1006: KK=KK+1;
|
||||||
|
if(KK >= LINSIZ)BUG(2);
|
||||||
|
LINES[KK]=GETTXT(FALSE,FALSE,FALSE,KK);
|
||||||
|
if(LINES[KK] != -1) goto L1006;
|
||||||
|
LINES[LINUSE]=KK;
|
||||||
|
if(LOC == OLDLOC) goto L1005;
|
||||||
|
OLDLOC=LOC;
|
||||||
|
LINES[LINUSE]= -KK;
|
||||||
|
if(SECT == 14) goto L1014;
|
||||||
|
if(SECT == 10) goto L1012;
|
||||||
|
if(SECT == 6) goto L1011;
|
||||||
|
if(SECT == 5) goto L1010;
|
||||||
|
if(LOC > LOCSIZ)BUG(10);
|
||||||
|
if(SECT == 1) goto L1008;
|
||||||
|
|
||||||
|
STEXT[LOC]=LINUSE;
|
||||||
|
goto L1005;
|
||||||
|
|
||||||
|
L1008: LTEXT[LOC]=LINUSE;
|
||||||
|
goto L1005;
|
||||||
|
|
||||||
|
L1010: if(LOC > 0 && LOC <= 100)PTEXT[LOC]=LINUSE;
|
||||||
|
goto L1005;
|
||||||
|
|
||||||
|
L1011: if(LOC > RTXSIZ)BUG(6);
|
||||||
|
RTEXT[LOC]=LINUSE;
|
||||||
|
goto L1005;
|
||||||
|
|
||||||
|
L1012: CLSSES=CLSSES+1;
|
||||||
|
if(CLSSES > CLSMAX)BUG(11);
|
||||||
|
CTEXT[CLSSES]=LINUSE;
|
||||||
|
CVAL[CLSSES]=LOC;
|
||||||
|
goto L1005;
|
||||||
|
|
||||||
|
L1014: TRNVLS=TRNVLS+1;
|
||||||
|
if(TRNVLS > TRNSIZ)BUG(11);
|
||||||
|
TTEXT[TRNVLS]=LINUSE;
|
||||||
|
TRNVAL[TRNVLS]=LOC;
|
||||||
|
goto L1005;
|
||||||
|
|
||||||
|
/* THE STUFF FOR SECTION 3 IS ENCODED HERE. EACH "FROM-LOCATION" GETS A
|
||||||
|
* CONTIGUOUS SECTION OF THE "TRAVEL" ARRAY. EACH ENTRY IN TRAVEL IS
|
||||||
|
* NEWLOC*1000 + KEYWORD (FROM SECTION 4, MOTION VERBS), AND IS NEGATED IF
|
||||||
|
* THIS IS THE LAST ENTRY FOR THIS LOCATION. KEY(N) IS THE INDEX IN TRAVEL
|
||||||
|
* OF THE FIRST OPTION AT LOCATION N. */
|
||||||
|
|
||||||
|
L1030: LOC=GETNUM(1);
|
||||||
|
if(LOC == -1) goto L1002;
|
||||||
|
NEWLOC=GETNUM(0);
|
||||||
|
if(KEY[LOC] != 0) goto L1033;
|
||||||
|
KEY[LOC]=TRVS;
|
||||||
|
goto L1035;
|
||||||
|
L1033: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++;
|
||||||
|
L1035: L=GETNUM(0);
|
||||||
|
if(L == 0) goto L1039;
|
||||||
|
TRAVEL[TRVS]=NEWLOC*1000+L;
|
||||||
|
TRVS=TRVS+1;
|
||||||
|
if(TRVS == TRVSIZ)BUG(3);
|
||||||
|
goto L1035;
|
||||||
|
L1039: TRVS--; TRAVEL[TRVS]= -TRAVEL[TRVS]; TRVS++;
|
||||||
|
goto L1030;
|
||||||
|
|
||||||
|
/* HERE WE READ IN THE VOCABULARY. KTAB(N) IS THE WORD NUMBER, ATAB(N) IS
|
||||||
|
* THE CORRESPONDING WORD. THE -1 AT THE END OF SECTION 4 IS LEFT IN KTAB
|
||||||
|
* AS AN END-MARKER. THE WORDS ARE GIVEN A MINIMAL HASH TO MAKE DECIPHERING
|
||||||
|
* THE CORE-IMAGE HARDER. (WE DON'T USE GETTXT'S HASH SINCE THAT WOULD FORCE
|
||||||
|
* US TO HASH EACH INPUT LINE TO MAKE COMPARISONS WORK, AND THAT IN TURN
|
||||||
|
* WOULD MAKE IT HARDER TO DETECT PARTICULAR INPUT WORDS.) */
|
||||||
|
|
||||||
|
L1040: J=10000;
|
||||||
|
/* 1042 */ for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) {
|
||||||
|
L1043: KTAB[TABNDX]=GETNUM(1);
|
||||||
|
if(KTAB[TABNDX] == -1) goto L1002;
|
||||||
|
J=J+7;
|
||||||
|
L1042: ATAB[TABNDX]=GETTXT(TRUE,TRUE,TRUE,0)+J*J;
|
||||||
|
} /* end loop */
|
||||||
|
BUG(4);
|
||||||
|
|
||||||
|
/* READ IN THE INITIAL LOCATIONS FOR EACH OBJECT. ALSO THE IMMOVABILITY INFO.
|
||||||
|
* PLAC CONTAINS INITIAL LOCATIONS OF OBJECTS. FIXD IS -1 FOR IMMOVABLE
|
||||||
|
* OBJECTS (INCLUDING THE SNAKE), OR = SECOND LOC FOR TWO-PLACED OBJECTS. */
|
||||||
|
|
||||||
|
L1050: OBJ=GETNUM(1);
|
||||||
|
if(OBJ == -1) goto L1002;
|
||||||
|
PLAC[OBJ]=GETNUM(0);
|
||||||
|
FIXD[OBJ]=GETNUM(0);
|
||||||
|
goto L1050;
|
||||||
|
|
||||||
|
/* READ DEFAULT MESSAGE NUMBERS FOR ACTION VERBS, STORE IN ACTSPK. */
|
||||||
|
|
||||||
|
L1060: VERB=GETNUM(1);
|
||||||
|
if(VERB == -1) goto L1002;
|
||||||
|
ACTSPK[VERB]=GETNUM(0);
|
||||||
|
goto L1060;
|
||||||
|
|
||||||
|
/* READ INFO ABOUT AVAILABLE LIQUIDS AND OTHER CONDITIONS, STORE IN COND. */
|
||||||
|
|
||||||
|
L1070: K=GETNUM(1);
|
||||||
|
if(K == -1) goto L1002;
|
||||||
|
L1071: LOC=GETNUM(0);
|
||||||
|
if(LOC == 0) goto L1070;
|
||||||
|
if(CNDBIT(LOC,K)) BUG(8);
|
||||||
|
COND[LOC]=COND[LOC]+SETBIT(K);
|
||||||
|
goto L1071;
|
||||||
|
|
||||||
|
/* READ DATA FOR HINTS. */
|
||||||
|
|
||||||
|
L1080: HNTMAX=0;
|
||||||
|
L1081: K=GETNUM(1);
|
||||||
|
if(K == -1) goto L1002;
|
||||||
|
if(K <= 0 || K > HNTSIZ)BUG(7);
|
||||||
|
/* 1083 */ for (I=1; I<=4; I++) {
|
||||||
|
L1083: HINTS[K][I] =GETNUM(0);
|
||||||
|
} /* end loop */
|
||||||
|
HNTMAX=(HNTMAX>K ? HNTMAX : K);
|
||||||
|
goto L1081;
|
||||||
|
|
||||||
|
/* READ THE SOUND/TEXT INFO, STORE IN OBJSND, OBJTXT, LOCSND. */
|
||||||
|
|
||||||
|
L1090: K=GETNUM(1);
|
||||||
|
if(K == -1) goto L1002;
|
||||||
|
KK=GETNUM(0);
|
||||||
|
I=GETNUM(0);
|
||||||
|
if(I == 0) goto L1092;
|
||||||
|
OBJSND[K]=(KK>0 ? KK : 0);
|
||||||
|
OBJTXT[K]=(I>0 ? I : 0);
|
||||||
|
goto L1090;
|
||||||
|
|
||||||
|
L1092: LOCSND[K]=KK;
|
||||||
|
goto L1090;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* FINISH CONSTRUCTING INTERNAL DATA FORMAT */
|
||||||
|
|
||||||
|
/* HAVING READ IN THE DATABASE, CERTAIN THINGS ARE NOW CONSTRUCTED. PROPS ARE
|
||||||
|
* SET TO ZERO. WE FINISH SETTING UP COND BY CHECKING FOR FORCED-MOTION TRAVEL
|
||||||
|
* ENTRIES. THE PLAC AND FIXD ARRAYS ARE USED TO SET UP ATLOC(N) AS THE FIRST
|
||||||
|
* OBJECT AT LOCATION N, AND LINK(OBJ) AS THE NEXT OBJECT AT THE SAME LOCATION
|
||||||
|
* AS OBJ. (OBJ>100 INDICATES THAT FIXED(OBJ-100)=LOC; LINK(OBJ) IS STILL THE
|
||||||
|
* CORRECT LINK TO USE.) ABB IS ZEROED; IT CONTROLS WHETHER THE ABBREVIATED
|
||||||
|
* DESCRIPTION IS PRINTED. COUNTS MOD 5 UNLESS "LOOK" IS USED. */
|
||||||
|
|
||||||
|
static finish_init() {
|
||||||
|
/* 1101 */ for (I=1; I<=100; I++) {
|
||||||
|
PLACE[I]=0;
|
||||||
|
PROP[I]=0;
|
||||||
|
LINK[I]=0;
|
||||||
|
L1101: {long x = I+100; LINK[x]=0;}
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* 1102 */ for (I=1; I<=LOCSIZ; I++) {
|
||||||
|
ABB[I]=0;
|
||||||
|
if(LTEXT[I] == 0 || KEY[I] == 0) goto L1102;
|
||||||
|
K=KEY[I];
|
||||||
|
if(MOD(IABS(TRAVEL[K]),1000) == 1)COND[I]=2;
|
||||||
|
L1102: ATLOC[I]=0;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* SET UP THE ATLOC AND LINK ARRAYS AS DESCRIBED ABOVE. WE'LL USE THE DROP
|
||||||
|
* SUBROUTINE, WHICH PREFACES NEW OBJECTS ON THE LISTS. SINCE WE WANT THINGS
|
||||||
|
* IN THE OTHER ORDER, WE'LL RUN THE LOOP BACKWARDS. IF THE OBJECT IS IN TWO
|
||||||
|
* LOCS, WE DROP IT TWICE. THIS ALSO SETS UP "PLACE" AND "FIXED" AS COPIES OF
|
||||||
|
* "PLAC" AND "FIXD". ALSO, SINCE TWO-PLACED OBJECTS ARE TYPICALLY BEST
|
||||||
|
* DESCRIBED LAST, WE'LL DROP THEM FIRST. */
|
||||||
|
|
||||||
|
/* 1106 */ for (I=1; I<=100; I++) {
|
||||||
|
K=101-I;
|
||||||
|
if(FIXD[K] <= 0) goto L1106;
|
||||||
|
DROP(K+100,FIXD[K]);
|
||||||
|
DROP(K,PLAC[K]);
|
||||||
|
L1106: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* 1107 */ for (I=1; I<=100; I++) {
|
||||||
|
K=101-I;
|
||||||
|
FIXED[K]=FIXD[K];
|
||||||
|
L1107: if(PLAC[K] != 0 && FIXD[K] <= 0)DROP(K,PLAC[K]);
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* TREASURES, AS NOTED EARLIER, ARE OBJECTS 50 THROUGH MAXTRS (CURRENTLY 79).
|
||||||
|
* THEIR PROPS ARE INITIALLY -1, AND ARE SET TO 0 THE FIRST TIME THEY ARE
|
||||||
|
* DESCRIBED. TALLY KEEPS TRACK OF HOW MANY ARE NOT YET FOUND, SO WE KNOW
|
||||||
|
* WHEN TO CLOSE THE CAVE. */
|
||||||
|
|
||||||
|
MAXTRS=79;
|
||||||
|
TALLY=0;
|
||||||
|
/* 1200 */ for (I=50; I<=MAXTRS; I++) {
|
||||||
|
if(PTEXT[I] != 0)PROP[I]= -1;
|
||||||
|
L1200: TALLY=TALLY-PROP[I];
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* CLEAR THE HINT STUFF. HINTLC(I) IS HOW LONG HE'S BEEN AT LOC WITH COND BIT
|
||||||
|
* I. HINTED(I) IS TRUE IFF HINT I HAS BEEN USED. */
|
||||||
|
|
||||||
|
/* 1300 */ for (I=1; I<=HNTMAX; I++) {
|
||||||
|
HINTED[I]=FALSE;
|
||||||
|
L1300: HINTLC[I]=0;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* DEFINE SOME HANDY MNEMONICS. THESE CORRESPOND TO OBJECT NUMBERS. */
|
||||||
|
|
||||||
|
AXE=VOCWRD(12405,1);
|
||||||
|
BATTER=VOCWRD(201202005,1);
|
||||||
|
BEAR=VOCWRD(2050118,1);
|
||||||
|
BIRD=VOCWRD(2091804,1);
|
||||||
|
BLOOD=VOCWRD(212151504,1);
|
||||||
|
BOTTLE=VOCWRD(215202012,1);
|
||||||
|
CAGE=VOCWRD(3010705,1);
|
||||||
|
CAVITY=VOCWRD(301220920,1);
|
||||||
|
CHASM=VOCWRD(308011913,1);
|
||||||
|
CLAM=VOCWRD(3120113,1);
|
||||||
|
DOOR=VOCWRD(4151518,1);
|
||||||
|
DRAGON=VOCWRD(418010715,1);
|
||||||
|
DWARF=VOCWRD(423011806,1);
|
||||||
|
FISSUR=VOCWRD(609191921,1);
|
||||||
|
FOOD=VOCWRD(6151504,1);
|
||||||
|
GRATE=VOCWRD(718012005,1);
|
||||||
|
KEYS=VOCWRD(11052519,1);
|
||||||
|
KNIFE=VOCWRD(1114090605,1);
|
||||||
|
LAMP=VOCWRD(12011316,1);
|
||||||
|
MAGZIN=VOCWRD(1301070126,1);
|
||||||
|
MESSAG=VOCWRD(1305191901,1);
|
||||||
|
MIRROR=VOCWRD(1309181815,1);
|
||||||
|
OGRE=VOCWRD(15071805,1);
|
||||||
|
OIL=VOCWRD(150912,1);
|
||||||
|
OYSTER=VOCWRD(1525192005,1);
|
||||||
|
PILLOW=VOCWRD(1609121215,1);
|
||||||
|
PLANT=VOCWRD(1612011420,1);
|
||||||
|
PLANT2=PLANT+1;
|
||||||
|
RESER=VOCWRD(1805190518,1);
|
||||||
|
ROD=VOCWRD(181504,1);
|
||||||
|
ROD2=ROD+1;
|
||||||
|
SIGN=VOCWRD(19090714,1);
|
||||||
|
SNAKE=VOCWRD(1914011105,1);
|
||||||
|
STEPS=VOCWRD(1920051619,1);
|
||||||
|
TROLL=VOCWRD(2018151212,1);
|
||||||
|
TROLL2=TROLL+1;
|
||||||
|
URN=VOCWRD(211814,1);
|
||||||
|
VEND=VOCWRD(1755140409,1);
|
||||||
|
VOLCAN=VOCWRD(1765120301,1);
|
||||||
|
WATER=VOCWRD(1851200518,1);
|
||||||
|
|
||||||
|
/* OBJECTS FROM 50 THROUGH WHATEVER ARE TREASURES. HERE ARE A FEW. */
|
||||||
|
|
||||||
|
AMBER=VOCWRD(113020518,1);
|
||||||
|
CHAIN=VOCWRD(308010914,1);
|
||||||
|
CHEST=VOCWRD(308051920,1);
|
||||||
|
COINS=VOCWRD(315091419,1);
|
||||||
|
EGGS=VOCWRD(5070719,1);
|
||||||
|
EMRALD=VOCWRD(513051801,1);
|
||||||
|
JADE=VOCWRD(10010405,1);
|
||||||
|
NUGGET=VOCWRD(7151204,1);
|
||||||
|
PEARL=VOCWRD(1605011812,1);
|
||||||
|
PYRAM=VOCWRD(1625180113,1);
|
||||||
|
RUBY=VOCWRD(18210225,1);
|
||||||
|
RUG=VOCWRD(182107,1);
|
||||||
|
SAPPH=VOCWRD(1901161608,1);
|
||||||
|
TRIDNT=VOCWRD(2018090405,1);
|
||||||
|
VASE=VOCWRD(22011905,1);
|
||||||
|
|
||||||
|
/* THESE ARE MOTION-VERB NUMBERS. */
|
||||||
|
|
||||||
|
BACK=VOCWRD(2010311,0);
|
||||||
|
CAVE=VOCWRD(3012205,0);
|
||||||
|
DPRSSN=VOCWRD(405161805,0);
|
||||||
|
ENTER=VOCWRD(514200518,0);
|
||||||
|
ENTRNC=VOCWRD(514201801,0);
|
||||||
|
LOOK=VOCWRD(12151511,0);
|
||||||
|
NUL=VOCWRD(14211212,0);
|
||||||
|
STREAM=VOCWRD(1920180501,0);
|
||||||
|
|
||||||
|
/* AND SOME ACTION VERBS. */
|
||||||
|
|
||||||
|
FIND=VOCWRD(6091404,2);
|
||||||
|
INVENT=VOCWRD(914220514,2);
|
||||||
|
LOCK=VOCWRD(12150311,2);
|
||||||
|
SAY=VOCWRD(190125,2);
|
||||||
|
THROW=VOCWRD(2008181523,2);
|
||||||
|
|
||||||
|
/* INITIALISE THE DWARVES. DLOC IS LOC OF DWARVES, HARD-WIRED IN. ODLOC IS
|
||||||
|
* PRIOR LOC OF EACH DWARF, INITIALLY GARBAGE. DALTLC IS ALTERNATE INITIAL LOC
|
||||||
|
* FOR DWARF, IN CASE ONE OF THEM STARTS OUT ON TOP OF THE ADVENTURER. (NO 2
|
||||||
|
* OF THE 5 INITIAL LOCS ARE ADJACENT.) DSEEN IS TRUE IF DWARF HAS SEEN HIM.
|
||||||
|
* DFLAG CONTROLS THE LEVEL OF ACTIVATION OF ALL THIS:
|
||||||
|
* 0 NO DWARF STUFF YET (WAIT UNTIL REACHES HALL OF MISTS)
|
||||||
|
* 1 REACHED HALL OF MISTS, BUT HASN'T MET FIRST DWARF
|
||||||
|
* 2 MET FIRST DWARF, OTHERS START MOVING, NO KNIVES THROWN YET
|
||||||
|
* 3 A KNIFE HAS BEEN THROWN (FIRST SET ALWAYS MISSES)
|
||||||
|
* 3+ DWARVES ARE MAD (INCREASES THEIR ACCURACY)
|
||||||
|
* SIXTH DWARF IS SPECIAL (THE PIRATE). HE ALWAYS STARTS AT HIS CHEST'S
|
||||||
|
* EVENTUAL LOCATION INSIDE THE MAZE. THIS LOC IS SAVED IN CHLOC FOR REF.
|
||||||
|
* THE DEAD END IN THE OTHER MAZE HAS ITS LOC STORED IN CHLOC2. */
|
||||||
|
|
||||||
|
CHLOC=114;
|
||||||
|
CHLOC2=140;
|
||||||
|
/* 1700 */ for (I=1; I<=6; I++) {
|
||||||
|
L1700: DSEEN[I]=FALSE;
|
||||||
|
} /* end loop */
|
||||||
|
DFLAG=0;
|
||||||
|
DLOC[1]=19;
|
||||||
|
DLOC[2]=27;
|
||||||
|
DLOC[3]=33;
|
||||||
|
DLOC[4]=44;
|
||||||
|
DLOC[5]=64;
|
||||||
|
DLOC[6]=CHLOC;
|
||||||
|
DALTLC=18;
|
||||||
|
|
||||||
|
/* OTHER RANDOM FLAGS AND COUNTERS, AS FOLLOWS:
|
||||||
|
* ABBNUM HOW OFTEN WE SHOULD PRINT NON-ABBREVIATED DESCRIPTIONS
|
||||||
|
* BONUS USED TO DETERMINE AMOUNT OF BONUS IF HE REACHES CLOSING
|
||||||
|
* CLOCK1 NUMBER OF TURNS FROM FINDING LAST TREASURE TILL CLOSING
|
||||||
|
* CLOCK2 NUMBER OF TURNS FROM FIRST WARNING TILL BLINDING FLASH
|
||||||
|
* CONDS MIN VALUE FOR COND(LOC) IF LOC HAS ANY HINTS
|
||||||
|
* DETAIL HOW OFTEN WE'VE SAID "NOT ALLOWED TO GIVE MORE DETAIL"
|
||||||
|
* DKILL NUMBER OF DWARVES KILLED (UNUSED IN SCORING, NEEDED FOR MSG)
|
||||||
|
* FOOBAR CURRENT PROGRESS IN SAYING "FEE FIE FOE FOO".
|
||||||
|
* HOLDNG NUMBER OF OBJECTS BEING CARRIED
|
||||||
|
* IGO HOW MANY TIMES HE'S SAID "GO XXX" INSTEAD OF "XXX"
|
||||||
|
* IWEST HOW MANY TIMES HE'S SAID "WEST" INSTEAD OF "W"
|
||||||
|
* KNFLOC 0 IF NO KNIFE HERE, LOC IF KNIFE HERE, -1 AFTER CAVEAT
|
||||||
|
* LIMIT LIFETIME OF LAMP (NOT SET HERE)
|
||||||
|
* MAXDIE NUMBER OF REINCARNATION MESSAGES AVAILABLE (UP TO 5)
|
||||||
|
* NUMDIE NUMBER OF TIMES KILLED SO FAR
|
||||||
|
* THRESH NEXT #TURNS THRESHHOLD (-1 IF NONE)
|
||||||
|
* TRNDEX INDEX IN TRNVAL OF NEXT THRESHHOLD (SECTION 14 OF DATABASE)
|
||||||
|
* TRNLUZ # POINTS LOST SO FAR DUE TO NUMBER OF TURNS USED
|
||||||
|
* TURNS TALLIES HOW MANY COMMANDS HE'S GIVEN (IGNORES YES/NO)
|
||||||
|
* LOGICALS WERE EXPLAINED EARLIER */
|
||||||
|
|
||||||
|
TURNS=0;
|
||||||
|
TRNDEX=1;
|
||||||
|
THRESH= -1;
|
||||||
|
if(TRNVLS > 0)THRESH=MOD(TRNVAL[1],100000)+1;
|
||||||
|
TRNLUZ=0;
|
||||||
|
LMWARN=FALSE;
|
||||||
|
IGO=0;
|
||||||
|
IWEST=0;
|
||||||
|
KNFLOC=0;
|
||||||
|
DETAIL=0;
|
||||||
|
ABBNUM=5;
|
||||||
|
/* 1800 */ for (I=0; I<=4; I++) {
|
||||||
|
L1800: {long x = 2*I+81; if(RTEXT[x] != 0)MAXDIE=I+1;}
|
||||||
|
} /* end loop */
|
||||||
|
NUMDIE=0;
|
||||||
|
HOLDNG=0;
|
||||||
|
DKILL=0;
|
||||||
|
FOOBAR=0;
|
||||||
|
BONUS=0;
|
||||||
|
CLOCK1=30;
|
||||||
|
CLOCK2=50;
|
||||||
|
CONDS=SETBIT(11);
|
||||||
|
SAVED=0;
|
||||||
|
CLOSNG=FALSE;
|
||||||
|
PANIC=FALSE;
|
||||||
|
CLOSED=FALSE;
|
||||||
|
CLSHNT=FALSE;
|
||||||
|
NOVICE=FALSE;
|
||||||
|
SETUP=1;
|
||||||
|
|
||||||
|
/* if we can ever think of how, we should save it at this point */
|
||||||
|
|
||||||
|
return(0); /* then we won't actually return from initialisation */
|
||||||
|
}
|
||||||
|
|
||||||
|
/* REPORT ON AMOUNT OF ARRAYS ACTUALLY USED, TO PERMIT REDUCTIONS. */
|
||||||
|
|
||||||
|
static report() {
|
||||||
|
/* 1998 */ for (K=1; K<=LOCSIZ; K++) {
|
||||||
|
KK=LOCSIZ+1-K;
|
||||||
|
if(LTEXT[KK] != 0) goto L1997;
|
||||||
|
L1998: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
OBJ=0;
|
||||||
|
L1997: /* 1996 */ for (K=1; K<=100; K++) {
|
||||||
|
L1996: if(PTEXT[K] != 0)OBJ=OBJ+1;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* 1995 */ for (K=1; K<=TABNDX; K++) {
|
||||||
|
L1995: if(KTAB[K]/1000 == 2)VERB=KTAB[K]-2000;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* 1994 */ for (K=1; K<=RTXSIZ; K++) {
|
||||||
|
J=RTXSIZ+1-K;
|
||||||
|
if(RTEXT[J] != 0) goto L1993;
|
||||||
|
L1994: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
L1993: SETPRM(1,LINUSE,LINSIZ);
|
||||||
|
SETPRM(3,TRVS,TRVSIZ);
|
||||||
|
SETPRM(5,TABNDX,TABSIZ);
|
||||||
|
SETPRM(7,KK,LOCSIZ);
|
||||||
|
SETPRM(9,OBJ,100);
|
||||||
|
SETPRM(11,VERB,VRBSIZ);
|
||||||
|
SETPRM(13,J,RTXSIZ);
|
||||||
|
SETPRM(15,CLSSES,CLSMAX);
|
||||||
|
SETPRM(17,HNTMAX,HNTSIZ);
|
||||||
|
SETPRM(19,TRNVLS,TRNSIZ);
|
||||||
|
RSPEAK(267);
|
||||||
|
TYPE0();
|
||||||
|
}
|
||||||
|
|
||||||
|
static long init_reading, init_cksum;
|
||||||
|
static FILE *f;
|
||||||
|
|
||||||
|
static void quick_item(long*);
|
||||||
|
static void quick_array(long*, long);
|
||||||
|
|
||||||
|
static quick_init() {
|
||||||
|
#ifdef AMIGA
|
||||||
|
f = fopen("ram:adventure.data", READ_MODE);
|
||||||
|
#else
|
||||||
|
extern char *getenv();
|
||||||
|
char *adv = getenv("ADVENTURE");
|
||||||
|
f = NULL;
|
||||||
|
if(adv)f = fopen(adv,READ_MODE);
|
||||||
|
#endif
|
||||||
|
if(f == NULL)f = fopen("adventure.data",READ_MODE);
|
||||||
|
if(f == NULL)return(FALSE);
|
||||||
|
init_reading = TRUE;
|
||||||
|
init_cksum = 1;
|
||||||
|
quick_io();
|
||||||
|
if(fread(&K,4,1,f) == 1) init_cksum -= K; else init_cksum = 1;
|
||||||
|
fclose(f);
|
||||||
|
if(init_cksum != 0)printf("Checksum error!\n");
|
||||||
|
return(init_cksum == 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
static quick_save() {
|
||||||
|
printf("Writing adventure.data...\n");
|
||||||
|
f = fopen("adventure.data",WRITE_MODE);
|
||||||
|
if(f == NULL){printf("Can't open file!\n"); return(0);}
|
||||||
|
init_reading = FALSE;
|
||||||
|
init_cksum = 1;
|
||||||
|
quick_io();
|
||||||
|
fwrite(&init_cksum,4,1,f);
|
||||||
|
fclose(f);
|
||||||
|
return(0);
|
||||||
|
}
|
||||||
|
|
||||||
|
static quick_io() {
|
||||||
|
quick_item(&LINUSE);
|
||||||
|
quick_item(&TRVS);
|
||||||
|
quick_item(&CLSSES);
|
||||||
|
quick_item(&TRNVLS);
|
||||||
|
quick_item(&TABNDX);
|
||||||
|
quick_item(&HNTMAX);
|
||||||
|
quick_array(PTEXT,100);
|
||||||
|
quick_array(RTEXT,RTXSIZ);
|
||||||
|
quick_array(CTEXT,CLSMAX);
|
||||||
|
quick_array(OBJSND,100);
|
||||||
|
quick_array(OBJTXT,100);
|
||||||
|
quick_array(STEXT,LOCSIZ);
|
||||||
|
quick_array(LTEXT,LOCSIZ);
|
||||||
|
quick_array(COND,LOCSIZ);
|
||||||
|
quick_array(KEY,LOCSIZ);
|
||||||
|
quick_array(LOCSND,LOCSIZ);
|
||||||
|
quick_array(LINES,LINSIZ);
|
||||||
|
quick_array(CVAL,CLSMAX);
|
||||||
|
quick_array(TTEXT,TRNSIZ);
|
||||||
|
quick_array(TRNVAL,TRNSIZ);
|
||||||
|
quick_array(TRAVEL,TRVSIZ);
|
||||||
|
quick_array(KTAB,TABSIZ);
|
||||||
|
quick_array(ATAB,TABSIZ);
|
||||||
|
quick_array(PLAC,100);
|
||||||
|
quick_array(FIXD,100);
|
||||||
|
quick_array(ACTSPK,VRBSIZ);
|
||||||
|
quick_array((long *)HINTS,(HNTMAX+1)*5-1);
|
||||||
|
return(0);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void quick_item(W)long *W; {
|
||||||
|
if(init_reading && fread(W,4,1,f) != 1)return;
|
||||||
|
init_cksum = MOD(init_cksum*13+(*W),60000000);
|
||||||
|
if(!init_reading)fwrite(W,4,1,f);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void quick_array(A,N)long *A, N; { long I;
|
||||||
|
if(init_reading && fread(A,4,N+1,f) != N+1)printf("Read error!\n");
|
||||||
|
for(I=1;I<=N;I++)init_cksum = MOD(init_cksum*13+A[I],60000000);
|
||||||
|
if(!init_reading && fwrite(A,4,N+1,f)!=N+1)printf("Write error!\n");
|
||||||
|
}
|
||||||
859
main.c
Normal file
859
main.c
Normal file
|
|
@ -0,0 +1,859 @@
|
||||||
|
#include "misc.h"
|
||||||
|
#ifdef __MSDOS__
|
||||||
|
#include "alloc.h"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define TRUE (0==0)
|
||||||
|
#define FALSE (0!=0)
|
||||||
|
long ABB[186], ATAB[331], ATLOC[186], BLKLIN = TRUE, DFLAG,
|
||||||
|
DLOC[7], FIXED[101], HOLDNG,
|
||||||
|
KTAB[331], *LINES, LINK[201], LNLENG, LNPOSN,
|
||||||
|
PARMS[26], PLACE[101], PTEXT[101], RTEXT[278],
|
||||||
|
SETUP = 0, TABSIZ = 330;
|
||||||
|
char INLINE[101], MAP1[129], MAP2[129];
|
||||||
|
|
||||||
|
long ABBNUM, ACTSPK[36], AMBER, ATTACK, AXE, BACK, BATTER, BEAR, BIRD, BLOOD, BONUS,
|
||||||
|
BOTTLE, CAGE, CAVE, CAVITY, CHAIN, CHASM, CHEST, CHLOC, CHLOC2,
|
||||||
|
CLAM, CLOCK1, CLOCK2, CLOSED, CLOSNG, CLSHNT, CLSMAX = 12, CLSSES,
|
||||||
|
COINS, COND[186], CONDS, CTEXT[13], CVAL[13], DALTLC, DETAIL,
|
||||||
|
DKILL, DOOR, DPRSSN, DRAGON, DSEEN[7], DTOTAL, DWARF, EGGS,
|
||||||
|
EMRALD, ENTER, ENTRNC, FIND, FISSUR, FIXD[101], FOOBAR, FOOD,
|
||||||
|
GRATE, HINT, HINTED[21], HINTLC[21], HINTS[21][5], HNTMAX,
|
||||||
|
HNTSIZ = 20, I, INVENT, IGO, IWEST, J, JADE, K, K2, KEY[186], KEYS, KK,
|
||||||
|
KNFLOC, KNIFE, KQ, L, LAMP, LIMIT, LINSIZ = 12500, LINUSE, LL,
|
||||||
|
LMWARN, LOC, LOCK, LOCSIZ = 185, LOCSND[186], LOOK, LTEXT[186],
|
||||||
|
MAGZIN, MAXDIE, MAXTRS, MESH = 123456789,
|
||||||
|
MESSAG, MIRROR, MXSCOR,
|
||||||
|
NEWLOC, NOVICE, NUGGET, NUL, NUMDIE, OBJ, OBJSND[101],
|
||||||
|
OBJTXT[101], ODLOC[7], OGRE, OIL, OLDLC2, OLDLOC, OLDOBJ, OYSTER,
|
||||||
|
PANIC, PEARL, PILLOW, PLAC[101], PLANT, PLANT2, PROP[101], PYRAM,
|
||||||
|
RESER, ROD, ROD2, RTXSIZ = 277, RUBY, RUG, SAPPH, SAVED, SAY,
|
||||||
|
SCORE, SECT, SIGN, SNAKE, SPK, STEPS, STEXT[186], STICK,
|
||||||
|
STREAM, TABNDX, TALLY, THRESH, THROW, TK[21], TRAVEL[886], TRIDNT,
|
||||||
|
TRNDEX, TRNLUZ, TRNSIZ = 5, TRNVAL[6], TRNVLS, TROLL, TROLL2, TRVS,
|
||||||
|
TRVSIZ = 885, TTEXT[6], TURNS, URN, V1, V2, VASE, VEND, VERB,
|
||||||
|
VOLCAN, VRBSIZ = 35, VRSION = 25, WATER, WD1, WD1X, WD2, WD2X,
|
||||||
|
WZDARK = FALSE, ZZWORD;
|
||||||
|
|
||||||
|
extern initialise();
|
||||||
|
extern void score(long);
|
||||||
|
extern action(long);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* MAIN PROGRAM
|
||||||
|
*/
|
||||||
|
|
||||||
|
main() {
|
||||||
|
|
||||||
|
/* ADVENTURE (REV 2: 20 TREASURES) */
|
||||||
|
|
||||||
|
/* HISTORY: ORIGINAL IDEA & 5-TREASURE VERSION (ADVENTURES) BY WILLIE CROWTHER
|
||||||
|
* 15-TREASURE VERSION (ADVENTURE) BY DON WOODS, APRIL-JUNE 1977
|
||||||
|
* 20-TREASURE VERSION (REV 2) BY DON WOODS, AUGUST 1978
|
||||||
|
* ERRATA FIXED: 78/12/25 */
|
||||||
|
|
||||||
|
|
||||||
|
/* LOGICAL VARIABLES:
|
||||||
|
*
|
||||||
|
* CLOSED SAYS WHETHER WE'RE ALL THE WAY CLOSED
|
||||||
|
* CLOSNG SAYS WHETHER IT'S CLOSING TIME YET
|
||||||
|
* CLSHNT SAYS WHETHER HE'S READ THE CLUE IN THE ENDGAME
|
||||||
|
* LMWARN SAYS WHETHER HE'S BEEN WARNED ABOUT LAMP GOING DIM
|
||||||
|
* NOVICE SAYS WHETHER HE ASKED FOR INSTRUCTIONS AT START-UP
|
||||||
|
* PANIC SAYS WHETHER HE'S FOUND OUT HE'S TRAPPED IN THE CAVE
|
||||||
|
* WZDARK SAYS WHETHER THE LOC HE'S LEAVING WAS DARK */
|
||||||
|
|
||||||
|
#include "funcs.h"
|
||||||
|
|
||||||
|
/* READ THE DATABASE IF WE HAVE NOT YET DONE SO */
|
||||||
|
|
||||||
|
LINES = (long *)calloc(LINSIZ+1,sizeof(long));
|
||||||
|
if(!LINES){
|
||||||
|
printf("Not enough memory!\n");
|
||||||
|
exit(FALSE);
|
||||||
|
}
|
||||||
|
|
||||||
|
MAP2[1] = 0;
|
||||||
|
if(!SETUP)initialise();
|
||||||
|
if(SETUP > 0) goto L1;
|
||||||
|
|
||||||
|
/* UNLIKE EARLIER VERSIONS, ADVENTURE IS NO LONGER RESTARTABLE. (THIS
|
||||||
|
* LETS US GET AWAY WITH MODIFYING THINGS SUCH AS OBJSND(BIRD) WITHOUT
|
||||||
|
* HAVING TO BE ABLE TO UNDO THE CHANGES LATER.) IF A "USED" COPY IS
|
||||||
|
* RERUN, WE COME HERE AND TELL THE PLAYER TO RUN A FRESH COPY. */
|
||||||
|
|
||||||
|
RSPEAK(201);
|
||||||
|
exit(FALSE);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* START-UP, DWARF STUFF */
|
||||||
|
|
||||||
|
L1: SETUP= -1;
|
||||||
|
I=RAN(-1);
|
||||||
|
ZZWORD=RNDVOC(3,0)+MESH*2;
|
||||||
|
NOVICE=YES(65,1,0);
|
||||||
|
NEWLOC=1;
|
||||||
|
LOC=1;
|
||||||
|
LIMIT=330;
|
||||||
|
if(NOVICE)LIMIT=1000;
|
||||||
|
|
||||||
|
/* CAN'T LEAVE CAVE ONCE IT'S CLOSING (EXCEPT BY MAIN OFFICE). */
|
||||||
|
|
||||||
|
L2: if(!OUTSID(NEWLOC) || NEWLOC == 0 || !CLOSNG) goto L71;
|
||||||
|
RSPEAK(130);
|
||||||
|
NEWLOC=LOC;
|
||||||
|
if(!PANIC)CLOCK2=15;
|
||||||
|
PANIC=TRUE;
|
||||||
|
|
||||||
|
/* SEE IF A DWARF HAS SEEN HIM AND HAS COME FROM WHERE HE WANTS TO GO. IF SO,
|
||||||
|
* THE DWARF'S BLOCKING HIS WAY. IF COMING FROM PLACE FORBIDDEN TO PIRATE
|
||||||
|
* (DWARVES ROOTED IN PLACE) LET HIM GET OUT (AND ATTACKED). */
|
||||||
|
|
||||||
|
L71: if(NEWLOC == LOC || FORCED(LOC) || CNDBIT(LOC,3)) goto L74;
|
||||||
|
/* 73 */ for (I=1; I<=5; I++) {
|
||||||
|
if(ODLOC[I] != NEWLOC || !DSEEN[I]) goto L73;
|
||||||
|
NEWLOC=LOC;
|
||||||
|
RSPEAK(2);
|
||||||
|
goto L74;
|
||||||
|
L73: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
L74: LOC=NEWLOC;
|
||||||
|
|
||||||
|
/* DWARF STUFF. SEE EARLIER COMMENTS FOR DESCRIPTION OF VARIABLES. REMEMBER
|
||||||
|
* SIXTH DWARF IS PIRATE AND IS THUS VERY DIFFERENT EXCEPT FOR MOTION RULES. */
|
||||||
|
|
||||||
|
/* FIRST OFF, DON'T LET THE DWARVES FOLLOW HIM INTO A PIT OR A WALL. ACTIVATE
|
||||||
|
* THE WHOLE MESS THE FIRST TIME HE GETS AS FAR AS THE HALL OF MISTS (LOC 15).
|
||||||
|
* IF NEWLOC IS FORBIDDEN TO PIRATE (IN PARTICULAR, IF IT'S BEYOND THE TROLL
|
||||||
|
* BRIDGE), BYPASS DWARF STUFF. THAT WAY PIRATE CAN'T STEAL RETURN TOLL, AND
|
||||||
|
* DWARVES CAN'T MEET THE BEAR. ALSO MEANS DWARVES WON'T FOLLOW HIM INTO DEAD
|
||||||
|
* END IN MAZE, BUT C'EST LA VIE. THEY'LL WAIT FOR HIM OUTSIDE THE DEAD END. */
|
||||||
|
|
||||||
|
if(LOC == 0 || FORCED(LOC) || CNDBIT(NEWLOC,3)) goto L2000;
|
||||||
|
if(DFLAG != 0) goto L6000;
|
||||||
|
if(INDEEP(LOC))DFLAG=1;
|
||||||
|
goto L2000;
|
||||||
|
|
||||||
|
/* WHEN WE ENCOUNTER THE FIRST DWARF, WE KILL 0, 1, OR 2 OF THE 5 DWARVES. IF
|
||||||
|
* ANY OF THE SURVIVORS IS AT LOC, REPLACE HIM WITH THE ALTERNATE. */
|
||||||
|
|
||||||
|
L6000: if(DFLAG != 1) goto L6010;
|
||||||
|
if(!INDEEP(LOC) || (PCT(95) && (!CNDBIT(LOC,4) || PCT(85)))) goto L2000;
|
||||||
|
DFLAG=2;
|
||||||
|
/* 6001 */ for (I=1; I<=2; I++) {
|
||||||
|
J=1+RAN(5);
|
||||||
|
L6001: if(PCT(50))DLOC[J]=0;
|
||||||
|
} /* end loop */
|
||||||
|
/* 6002 */ for (I=1; I<=5; I++) {
|
||||||
|
if(DLOC[I] == LOC)DLOC[I]=DALTLC;
|
||||||
|
L6002: ODLOC[I]=DLOC[I];
|
||||||
|
} /* end loop */
|
||||||
|
RSPEAK(3);
|
||||||
|
DROP(AXE,LOC);
|
||||||
|
goto L2000;
|
||||||
|
|
||||||
|
/* THINGS ARE IN FULL SWING. MOVE EACH DWARF AT RANDOM, EXCEPT IF HE'S SEEN US
|
||||||
|
* HE STICKS WITH US. DWARVES STAY DEEP INSIDE. IF WANDERING AT RANDOM,
|
||||||
|
* THEY DON'T BACK UP UNLESS THERE'S NO ALTERNATIVE. IF THEY DON'T HAVE TO
|
||||||
|
* MOVE, THEY ATTACK. AND, OF COURSE, DEAD DWARVES DON'T DO MUCH OF ANYTHING. */
|
||||||
|
|
||||||
|
L6010: DTOTAL=0;
|
||||||
|
ATTACK=0;
|
||||||
|
STICK=0;
|
||||||
|
/* 6030 */ for (I=1; I<=6; I++) {
|
||||||
|
if(DLOC[I] == 0) goto L6030;
|
||||||
|
/* FILL TK ARRAY WITH ALL THE PLACES THIS DWARF MIGHT GO. */
|
||||||
|
J=1;
|
||||||
|
KK=DLOC[I];
|
||||||
|
KK=KEY[KK];
|
||||||
|
if(KK == 0) goto L6016;
|
||||||
|
L6012: NEWLOC=MOD(IABS(TRAVEL[KK])/1000,1000);
|
||||||
|
{long x = J-1;
|
||||||
|
if(NEWLOC > 300 || !INDEEP(NEWLOC) || NEWLOC == ODLOC[I] || (J > 1 &&
|
||||||
|
NEWLOC == TK[x]) || J >= 20 || NEWLOC == DLOC[I] ||
|
||||||
|
FORCED(NEWLOC) || (I == 6 && CNDBIT(NEWLOC,3)) ||
|
||||||
|
IABS(TRAVEL[KK])/1000000 == 100) goto L6014;}
|
||||||
|
TK[J]=NEWLOC;
|
||||||
|
J=J+1;
|
||||||
|
L6014: KK=KK+1;
|
||||||
|
{long x = KK-1; if(TRAVEL[x] >= 0) goto L6012;}
|
||||||
|
L6016: TK[J]=ODLOC[I];
|
||||||
|
if(J >= 2)J=J-1;
|
||||||
|
J=1+RAN(J);
|
||||||
|
ODLOC[I]=DLOC[I];
|
||||||
|
DLOC[I]=TK[J];
|
||||||
|
DSEEN[I]=(DSEEN[I] && INDEEP(LOC)) || (DLOC[I] == LOC || ODLOC[I] == LOC);
|
||||||
|
if(!DSEEN[I]) goto L6030;
|
||||||
|
DLOC[I]=LOC;
|
||||||
|
if(I != 6) goto L6027;
|
||||||
|
|
||||||
|
/* THE PIRATE'S SPOTTED HIM. HE LEAVES HIM ALONE ONCE WE'VE FOUND CHEST. K
|
||||||
|
* COUNTS IF A TREASURE IS HERE. IF NOT, AND TALLY=1 FOR AN UNSEEN CHEST, LET
|
||||||
|
* THE PIRATE BE SPOTTED. NOTE THAT PLACE(CHEST)=0 MIGHT MEAN THAT HE'S
|
||||||
|
* THROWN IT TO THE TROLL, BUT IN THAT CASE HE'S SEEN THE CHEST (PROP=0). */
|
||||||
|
|
||||||
|
if(LOC == CHLOC || PROP[CHEST] >= 0) goto L6030;
|
||||||
|
K=0;
|
||||||
|
/* 6020 */ for (J=50; J<=MAXTRS; J++) {
|
||||||
|
/* PIRATE WON'T TAKE PYRAMID FROM PLOVER ROOM OR DARK ROOM (TOO EASY!). */
|
||||||
|
if(J == PYRAM && (LOC == PLAC[PYRAM] || LOC == PLAC[EMRALD])) goto L6020;
|
||||||
|
if(TOTING(J)) goto L6021;
|
||||||
|
L6020: if(HERE(J))K=1;
|
||||||
|
} /* end loop */
|
||||||
|
if(TALLY == 1 && K == 0 && PLACE[CHEST] == 0 && HERE(LAMP) && PROP[LAMP]
|
||||||
|
== 1) goto L6025;
|
||||||
|
if(ODLOC[6] != DLOC[6] && PCT(20))RSPEAK(127);
|
||||||
|
goto L6030;
|
||||||
|
|
||||||
|
L6021: if(PLACE[CHEST] != 0) goto L6022;
|
||||||
|
/* INSTALL CHEST ONLY ONCE, TO INSURE IT IS THE LAST TREASURE IN THE LIST. */
|
||||||
|
MOVE(CHEST,CHLOC);
|
||||||
|
MOVE(MESSAG,CHLOC2);
|
||||||
|
L6022: RSPEAK(128);
|
||||||
|
/* 6023 */ for (J=50; J<=MAXTRS; J++) {
|
||||||
|
if(J == PYRAM && (LOC == PLAC[PYRAM] || LOC == PLAC[EMRALD])) goto L6023;
|
||||||
|
if(AT(J) && FIXED[J] == 0)CARRY(J,LOC);
|
||||||
|
if(TOTING(J))DROP(J,CHLOC);
|
||||||
|
L6023: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
L6024: DLOC[6]=CHLOC;
|
||||||
|
ODLOC[6]=CHLOC;
|
||||||
|
DSEEN[6]=FALSE;
|
||||||
|
goto L6030;
|
||||||
|
|
||||||
|
L6025: RSPEAK(186);
|
||||||
|
MOVE(CHEST,CHLOC);
|
||||||
|
MOVE(MESSAG,CHLOC2);
|
||||||
|
goto L6024;
|
||||||
|
|
||||||
|
/* THIS THREATENING LITTLE DWARF IS IN THE ROOM WITH HIM! */
|
||||||
|
|
||||||
|
L6027: DTOTAL=DTOTAL+1;
|
||||||
|
if(ODLOC[I] != DLOC[I]) goto L6030;
|
||||||
|
ATTACK=ATTACK+1;
|
||||||
|
if(KNFLOC >= 0)KNFLOC=LOC;
|
||||||
|
if(RAN(1000) < 95*(DFLAG-2))STICK=STICK+1;
|
||||||
|
L6030: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* NOW WE KNOW WHAT'S HAPPENING. LET'S TELL THE POOR SUCKER ABOUT IT.
|
||||||
|
* NOTE THAT VARIOUS OF THE "KNIFE" MESSAGES MUST HAVE SPECIFIC RELATIVE
|
||||||
|
* POSITIONS IN THE RSPEAK DATABASE. */
|
||||||
|
|
||||||
|
if(DTOTAL == 0) goto L2000;
|
||||||
|
SETPRM(1,DTOTAL,0);
|
||||||
|
RSPEAK(4+1/DTOTAL);
|
||||||
|
if(ATTACK == 0) goto L2000;
|
||||||
|
if(DFLAG == 2)DFLAG=3;
|
||||||
|
SETPRM(1,ATTACK,0);
|
||||||
|
K=6;
|
||||||
|
if(ATTACK > 1)K=250;
|
||||||
|
RSPEAK(K);
|
||||||
|
SETPRM(1,STICK,0);
|
||||||
|
RSPEAK(K+1+2/(1+STICK));
|
||||||
|
if(STICK == 0) goto L2000;
|
||||||
|
OLDLC2=LOC;
|
||||||
|
goto L99;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* DESCRIBE THE CURRENT LOCATION AND (MAYBE) GET NEXT COMMAND. */
|
||||||
|
|
||||||
|
/* PRINT TEXT FOR CURRENT LOC. */
|
||||||
|
|
||||||
|
L2000: if(LOC == 0) goto L99;
|
||||||
|
KK=STEXT[LOC];
|
||||||
|
if(MOD(ABB[LOC],ABBNUM) == 0 || KK == 0)KK=LTEXT[LOC];
|
||||||
|
if(FORCED(LOC) || !DARK(0)) goto L2001;
|
||||||
|
if(WZDARK && PCT(35)) goto L90;
|
||||||
|
KK=RTEXT[16];
|
||||||
|
L2001: if(TOTING(BEAR))RSPEAK(141);
|
||||||
|
SPEAK(KK);
|
||||||
|
K=1;
|
||||||
|
if(FORCED(LOC)) goto L8;
|
||||||
|
if(LOC == 33 && PCT(25) && !CLOSNG)RSPEAK(7);
|
||||||
|
|
||||||
|
/* PRINT OUT DESCRIPTIONS OF OBJECTS AT THIS LOCATION. IF NOT CLOSING AND
|
||||||
|
* PROPERTY VALUE IS NEGATIVE, TALLY OFF ANOTHER TREASURE. RUG IS SPECIAL
|
||||||
|
* CASE; ONCE SEEN, ITS PROP IS 1 (DRAGON ON IT) TILL DRAGON IS KILLED.
|
||||||
|
* SIMILARLY FOR CHAIN; PROP IS INITIALLY 1 (LOCKED TO BEAR). THESE HACKS
|
||||||
|
* ARE BECAUSE PROP=0 IS NEEDED TO GET FULL SCORE. */
|
||||||
|
|
||||||
|
if(DARK(0)) goto L2012;
|
||||||
|
ABB[LOC]=ABB[LOC]+1;
|
||||||
|
I=ATLOC[LOC];
|
||||||
|
L2004: if(I == 0) goto L2012;
|
||||||
|
OBJ=I;
|
||||||
|
if(OBJ > 100)OBJ=OBJ-100;
|
||||||
|
if(OBJ == STEPS && TOTING(NUGGET)) goto L2008;
|
||||||
|
if(PROP[OBJ] >= 0) goto L2006;
|
||||||
|
if(CLOSED) goto L2008;
|
||||||
|
PROP[OBJ]=0;
|
||||||
|
if(OBJ == RUG || OBJ == CHAIN)PROP[OBJ]=1;
|
||||||
|
TALLY=TALLY-1;
|
||||||
|
/* NOTE: THERE USED TO BE A TEST HERE TO SEE WHETHER THE PLAYER HAD BLOWN IT
|
||||||
|
* SO BADLY THAT HE COULD NEVER EVER SEE THE REMAINING TREASURES, AND IF SO
|
||||||
|
* THE LAMP WAS ZAPPED TO 35 TURNS. BUT THE TESTS WERE TOO SIMPLE-MINDED;
|
||||||
|
* THINGS LIKE KILLING THE BIRD BEFORE THE SNAKE WAS GONE (CAN NEVER SEE
|
||||||
|
* JEWELRY), AND DOING IT "RIGHT" WAS HOPELESS. E.G., COULD CROSS TROLL
|
||||||
|
* BRIDGE SEVERAL TIMES, USING UP ALL AVAILABLE TREASURES, BREAKING VASE,
|
||||||
|
* USING COINS TO BUY BATTERIES, ETC., AND EVENTUALLY NEVER BE ABLE TO GET
|
||||||
|
* ACROSS AGAIN. IF BOTTLE WERE LEFT ON FAR SIDE, COULD THEN NEVER GET EGGS
|
||||||
|
* OR TRIDENT, AND THE EFFECTS PROPAGATE. SO THE WHOLE THING WAS FLUSHED.
|
||||||
|
* ANYONE WHO MAKES SUCH A GROSS BLUNDER ISN'T LIKELY TO FIND EVERYTHING
|
||||||
|
* ELSE ANYWAY (SO GOES THE RATIONALISATION). */
|
||||||
|
L2006: KK=PROP[OBJ];
|
||||||
|
if(OBJ == STEPS && LOC == FIXED[STEPS])KK=1;
|
||||||
|
PSPEAK(OBJ,KK);
|
||||||
|
L2008: I=LINK[I];
|
||||||
|
goto L2004;
|
||||||
|
|
||||||
|
L2009: K=54;
|
||||||
|
L2010: SPK=K;
|
||||||
|
L2011: RSPEAK(SPK);
|
||||||
|
|
||||||
|
L2012: VERB=0;
|
||||||
|
OLDOBJ=OBJ;
|
||||||
|
OBJ=0;
|
||||||
|
|
||||||
|
/* CHECK IF THIS LOC IS ELIGIBLE FOR ANY HINTS. IF BEEN HERE LONG ENOUGH,
|
||||||
|
* BRANCH TO HELP SECTION (ON LATER PAGE). HINTS ALL COME BACK HERE EVENTUALLY
|
||||||
|
* TO FINISH THE LOOP. IGNORE "HINTS" < 4 (SPECIAL STUFF, SEE DATABASE NOTES).
|
||||||
|
*/
|
||||||
|
|
||||||
|
L2600: if(COND[LOC] < CONDS) goto L2603;
|
||||||
|
/* 2602 */ for (HINT=1; HINT<=HNTMAX; HINT++) {
|
||||||
|
if(HINTED[HINT]) goto L2602;
|
||||||
|
if(!CNDBIT(LOC,HINT+10))HINTLC[HINT]= -1;
|
||||||
|
HINTLC[HINT]=HINTLC[HINT]+1;
|
||||||
|
if(HINTLC[HINT] >= HINTS[HINT][1]) goto L40000;
|
||||||
|
L2602: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* KICK THE RANDOM NUMBER GENERATOR JUST TO ADD VARIETY TO THE CHASE. ALSO,
|
||||||
|
* IF CLOSING TIME, CHECK FOR ANY OBJECTS BEING TOTED WITH PROP < 0 AND SET
|
||||||
|
* THE PROP TO -1-PROP. THIS WAY OBJECTS WON'T BE DESCRIBED UNTIL THEY'VE
|
||||||
|
* BEEN PICKED UP AND PUT DOWN SEPARATE FROM THEIR RESPECTIVE PILES. DON'T
|
||||||
|
* TICK CLOCK1 UNLESS WELL INTO CAVE (AND NOT AT Y2). */
|
||||||
|
|
||||||
|
L2603: if(!CLOSED) goto L2605;
|
||||||
|
if(PROP[OYSTER] < 0 && TOTING(OYSTER))PSPEAK(OYSTER,1);
|
||||||
|
/* 2604 */ for (I=1; I<=100; I++) {
|
||||||
|
L2604: if(TOTING(I) && PROP[I] < 0)PROP[I]= -1-PROP[I];
|
||||||
|
} /* end loop */
|
||||||
|
L2605: WZDARK=DARK(0);
|
||||||
|
if(KNFLOC > 0 && KNFLOC != LOC)KNFLOC=0;
|
||||||
|
I=RAN(1);
|
||||||
|
GETIN(WD1,WD1X,WD2,WD2X);
|
||||||
|
|
||||||
|
/* EVERY INPUT, CHECK "FOOBAR" FLAG. IF ZERO, NOTHING'S GOING ON. IF POS,
|
||||||
|
* MAKE NEG. IF NEG, HE SKIPPED A WORD, SO MAKE IT ZERO. */
|
||||||
|
|
||||||
|
L2607: FOOBAR=(FOOBAR>0 ? -FOOBAR : 0);
|
||||||
|
TURNS=TURNS+1;
|
||||||
|
if(TURNS != THRESH) goto L2608;
|
||||||
|
SPEAK(TTEXT[TRNDEX]);
|
||||||
|
TRNLUZ=TRNLUZ+TRNVAL[TRNDEX]/100000;
|
||||||
|
TRNDEX=TRNDEX+1;
|
||||||
|
THRESH= -1;
|
||||||
|
if(TRNDEX <= TRNVLS)THRESH=MOD(TRNVAL[TRNDEX],100000)+1;
|
||||||
|
L2608: if(VERB == SAY && WD2 > 0)VERB=0;
|
||||||
|
if(VERB == SAY) goto L4090;
|
||||||
|
if(TALLY == 0 && INDEEP(LOC) && LOC != 33)CLOCK1=CLOCK1-1;
|
||||||
|
if(CLOCK1 == 0) goto L10000;
|
||||||
|
if(CLOCK1 < 0)CLOCK2=CLOCK2-1;
|
||||||
|
if(CLOCK2 == 0) goto L11000;
|
||||||
|
if(PROP[LAMP] == 1)LIMIT=LIMIT-1;
|
||||||
|
if(LIMIT <= 30 && HERE(BATTER) && PROP[BATTER] == 0 && HERE(LAMP)) goto
|
||||||
|
L12000;
|
||||||
|
if(LIMIT == 0) goto L12400;
|
||||||
|
if(LIMIT <= 30) goto L12200;
|
||||||
|
L19999: K=43;
|
||||||
|
if(LIQLOC(LOC) == WATER)K=70;
|
||||||
|
V1=VOCAB(WD1,-1);
|
||||||
|
V2=VOCAB(WD2,-1);
|
||||||
|
if(V1 == ENTER && (V2 == STREAM || V2 == 1000+WATER)) goto L2010;
|
||||||
|
if(V1 == ENTER && WD2 > 0) goto L2800;
|
||||||
|
if((V1 != 1000+WATER && V1 != 1000+OIL) || (V2 != 1000+PLANT && V2 !=
|
||||||
|
1000+DOOR)) goto L2610;
|
||||||
|
{long x = V2-1000; if(AT(x))WD2=MAKEWD(16152118);}
|
||||||
|
L2610: if(V1 == 1000+CAGE && V2 == 1000+BIRD && HERE(CAGE) &&
|
||||||
|
HERE(BIRD))WD1=MAKEWD(301200308);
|
||||||
|
L2620: if(WD1 != MAKEWD(23051920)) goto L2625;
|
||||||
|
IWEST=IWEST+1;
|
||||||
|
if(IWEST == 10)RSPEAK(17);
|
||||||
|
L2625: if(WD1 != MAKEWD( 715) || WD2 == 0) goto L2630;
|
||||||
|
IGO=IGO+1;
|
||||||
|
if(IGO == 10)RSPEAK(276);
|
||||||
|
L2630: I=VOCAB(WD1,-1);
|
||||||
|
if(I == -1) goto L3000;
|
||||||
|
K=MOD(I,1000);
|
||||||
|
KQ=I/1000+1;
|
||||||
|
switch (KQ-1) { case 0: goto L8; case 1: goto L5000; case 2: goto L4000;
|
||||||
|
case 3: goto L2010; }
|
||||||
|
BUG(22);
|
||||||
|
|
||||||
|
/* GET SECOND WORD FOR ANALYSIS. */
|
||||||
|
|
||||||
|
L2800: WD1=WD2;
|
||||||
|
WD1X=WD2X;
|
||||||
|
WD2=0;
|
||||||
|
goto L2620;
|
||||||
|
|
||||||
|
/* GEE, I DON'T UNDERSTAND. */
|
||||||
|
|
||||||
|
L3000: SETPRM(1,WD1,WD1X);
|
||||||
|
RSPEAK(254);
|
||||||
|
goto L2600;
|
||||||
|
|
||||||
|
/* VERB AND OBJECT ANALYSIS MOVED TO SEPARATE MODULE. */
|
||||||
|
|
||||||
|
L4000: I=4000; goto Laction;
|
||||||
|
L4090: I=4090; goto Laction;
|
||||||
|
L5000: I=5000;
|
||||||
|
Laction:
|
||||||
|
switch (action(I)) {
|
||||||
|
case 2: goto L2;
|
||||||
|
case 8: goto L8;
|
||||||
|
case 2000: goto L2000;
|
||||||
|
case 2009: goto L2009;
|
||||||
|
case 2010: goto L2010;
|
||||||
|
case 2011: goto L2011;
|
||||||
|
case 2012: goto L2012;
|
||||||
|
case 2600: goto L2600;
|
||||||
|
case 2607: goto L2607;
|
||||||
|
case 2630: goto L2630;
|
||||||
|
case 2800: goto L2800;
|
||||||
|
case 8000: goto L8000;
|
||||||
|
case 18999: goto L18999;
|
||||||
|
case 19000: goto L19000;
|
||||||
|
}
|
||||||
|
BUG(99);
|
||||||
|
|
||||||
|
/* RANDOM INTRANSITIVE VERBS COME HERE. CLEAR OBJ JUST IN CASE (SEE "ATTACK").
|
||||||
|
*/
|
||||||
|
|
||||||
|
L8000: SETPRM(1,WD1,WD1X);
|
||||||
|
RSPEAK(257);
|
||||||
|
OBJ=0;
|
||||||
|
goto L2600;
|
||||||
|
|
||||||
|
/* FIGURE OUT THE NEW LOCATION
|
||||||
|
*
|
||||||
|
* GIVEN THE CURRENT LOCATION IN "LOC", AND A MOTION VERB NUMBER IN "K", PUT
|
||||||
|
* THE NEW LOCATION IN "NEWLOC". THE CURRENT LOC IS SAVED IN "OLDLOC" IN CASE
|
||||||
|
* HE WANTS TO RETREAT. THE CURRENT OLDLOC IS SAVED IN OLDLC2, IN CASE HE
|
||||||
|
* DIES. (IF HE DOES, NEWLOC WILL BE LIMBO, AND OLDLOC WILL BE WHAT KILLED
|
||||||
|
* HIM, SO WE NEED OLDLC2, WHICH IS THE LAST PLACE HE WAS SAFE.) */
|
||||||
|
|
||||||
|
L8: KK=KEY[LOC];
|
||||||
|
NEWLOC=LOC;
|
||||||
|
if(KK == 0)BUG(26);
|
||||||
|
if(K == NUL) goto L2;
|
||||||
|
if(K == BACK) goto L20;
|
||||||
|
if(K == LOOK) goto L30;
|
||||||
|
if(K == CAVE) goto L40;
|
||||||
|
OLDLC2=OLDLOC;
|
||||||
|
OLDLOC=LOC;
|
||||||
|
|
||||||
|
L9: LL=IABS(TRAVEL[KK]);
|
||||||
|
if(MOD(LL,1000) == 1 || MOD(LL,1000) == K) goto L10;
|
||||||
|
if(TRAVEL[KK] < 0) goto L50;
|
||||||
|
KK=KK+1;
|
||||||
|
goto L9;
|
||||||
|
|
||||||
|
L10: LL=LL/1000;
|
||||||
|
L11: NEWLOC=LL/1000;
|
||||||
|
K=MOD(NEWLOC,100);
|
||||||
|
if(NEWLOC <= 300) goto L13;
|
||||||
|
if(PROP[K] != NEWLOC/100-3) goto L16;
|
||||||
|
L12: if(TRAVEL[KK] < 0)BUG(25);
|
||||||
|
KK=KK+1;
|
||||||
|
NEWLOC=IABS(TRAVEL[KK])/1000;
|
||||||
|
if(NEWLOC == LL) goto L12;
|
||||||
|
LL=NEWLOC;
|
||||||
|
goto L11;
|
||||||
|
|
||||||
|
L13: if(NEWLOC <= 100) goto L14;
|
||||||
|
if(TOTING(K) || (NEWLOC > 200 && AT(K))) goto L16;
|
||||||
|
goto L12;
|
||||||
|
|
||||||
|
L14: if(NEWLOC != 0 && !PCT(NEWLOC)) goto L12;
|
||||||
|
L16: NEWLOC=MOD(LL,1000);
|
||||||
|
if(NEWLOC <= 300) goto L2;
|
||||||
|
if(NEWLOC <= 500) goto L30000;
|
||||||
|
RSPEAK(NEWLOC-500);
|
||||||
|
NEWLOC=LOC;
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
/* SPECIAL MOTIONS COME HERE. LABELLING CONVENTION: STATEMENT NUMBERS NNNXX
|
||||||
|
* (XX=00-99) ARE USED FOR SPECIAL CASE NUMBER NNN (NNN=301-500). */
|
||||||
|
|
||||||
|
L30000: NEWLOC=NEWLOC-300;
|
||||||
|
switch (NEWLOC) { case 1: goto L30100; case 2: goto L30200; case 3: goto
|
||||||
|
L30300; }
|
||||||
|
BUG(20);
|
||||||
|
|
||||||
|
/* TRAVEL 301. PLOVER-ALCOVE PASSAGE. CAN CARRY ONLY EMERALD. NOTE: TRAVEL
|
||||||
|
* TABLE MUST INCLUDE "USELESS" ENTRIES GOING THROUGH PASSAGE, WHICH CAN NEVER
|
||||||
|
* BE USED FOR ACTUAL MOTION, BUT CAN BE SPOTTED BY "GO BACK". */
|
||||||
|
|
||||||
|
L30100: NEWLOC=99+100-LOC;
|
||||||
|
if(HOLDNG == 0 || (HOLDNG == 1 && TOTING(EMRALD))) goto L2;
|
||||||
|
NEWLOC=LOC;
|
||||||
|
RSPEAK(117);
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
/* TRAVEL 302. PLOVER TRANSPORT. DROP THE EMERALD (ONLY USE SPECIAL TRAVEL IF
|
||||||
|
* TOTING IT), SO HE'S FORCED TO USE THE PLOVER-PASSAGE TO GET IT OUT. HAVING
|
||||||
|
* DROPPED IT, GO BACK AND PRETEND HE WASN'T CARRYING IT AFTER ALL. */
|
||||||
|
|
||||||
|
L30200: DROP(EMRALD,LOC);
|
||||||
|
goto L12;
|
||||||
|
|
||||||
|
/* TRAVEL 303. TROLL BRIDGE. MUST BE DONE ONLY AS SPECIAL MOTION SO THAT
|
||||||
|
* DWARVES WON'T WANDER ACROSS AND ENCOUNTER THE BEAR. (THEY WON'T FOLLOW THE
|
||||||
|
* PLAYER THERE BECAUSE THAT REGION IS FORBIDDEN TO THE PIRATE.) IF
|
||||||
|
* PROP(TROLL)=1, HE'S CROSSED SINCE PAYING, SO STEP OUT AND BLOCK HIM.
|
||||||
|
* (STANDARD TRAVEL ENTRIES CHECK FOR PROP(TROLL)=0.) SPECIAL STUFF FOR BEAR. */
|
||||||
|
|
||||||
|
L30300: if(PROP[TROLL] != 1) goto L30310;
|
||||||
|
PSPEAK(TROLL,1);
|
||||||
|
PROP[TROLL]=0;
|
||||||
|
MOVE(TROLL2,0);
|
||||||
|
MOVE(TROLL2+100,0);
|
||||||
|
MOVE(TROLL,PLAC[TROLL]);
|
||||||
|
MOVE(TROLL+100,FIXD[TROLL]);
|
||||||
|
JUGGLE(CHASM);
|
||||||
|
NEWLOC=LOC;
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
L30310: NEWLOC=PLAC[TROLL]+FIXD[TROLL]-LOC;
|
||||||
|
if(PROP[TROLL] == 0)PROP[TROLL]=1;
|
||||||
|
if(!TOTING(BEAR)) goto L2;
|
||||||
|
RSPEAK(162);
|
||||||
|
PROP[CHASM]=1;
|
||||||
|
PROP[TROLL]=2;
|
||||||
|
DROP(BEAR,NEWLOC);
|
||||||
|
FIXED[BEAR]= -1;
|
||||||
|
PROP[BEAR]=3;
|
||||||
|
OLDLC2=NEWLOC;
|
||||||
|
goto L99;
|
||||||
|
|
||||||
|
/* END OF SPECIALS. */
|
||||||
|
|
||||||
|
/* HANDLE "GO BACK". LOOK FOR VERB WHICH GOES FROM LOC TO OLDLOC, OR TO OLDLC2
|
||||||
|
* IF OLDLOC HAS FORCED-MOTION. K2 SAVES ENTRY -> FORCED LOC -> PREVIOUS LOC. */
|
||||||
|
|
||||||
|
L20: K=OLDLOC;
|
||||||
|
if(FORCED(K))K=OLDLC2;
|
||||||
|
OLDLC2=OLDLOC;
|
||||||
|
OLDLOC=LOC;
|
||||||
|
K2=0;
|
||||||
|
if(K == LOC)K2=91;
|
||||||
|
if(CNDBIT(LOC,4))K2=274;
|
||||||
|
if(K2 == 0) goto L21;
|
||||||
|
RSPEAK(K2);
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
L21: LL=MOD((IABS(TRAVEL[KK])/1000),1000);
|
||||||
|
if(LL == K) goto L25;
|
||||||
|
if(LL > 300) goto L22;
|
||||||
|
J=KEY[LL];
|
||||||
|
if(FORCED(LL) && MOD((IABS(TRAVEL[J])/1000),1000) == K)K2=KK;
|
||||||
|
L22: if(TRAVEL[KK] < 0) goto L23;
|
||||||
|
KK=KK+1;
|
||||||
|
goto L21;
|
||||||
|
|
||||||
|
L23: KK=K2;
|
||||||
|
if(KK != 0) goto L25;
|
||||||
|
RSPEAK(140);
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
L25: K=MOD(IABS(TRAVEL[KK]),1000);
|
||||||
|
KK=KEY[LOC];
|
||||||
|
goto L9;
|
||||||
|
|
||||||
|
/* LOOK. CAN'T GIVE MORE DETAIL. PRETEND IT WASN'T DARK (THOUGH IT MAY "NOW"
|
||||||
|
* BE DARK) SO HE WON'T FALL INTO A PIT WHILE STARING INTO THE GLOOM. */
|
||||||
|
|
||||||
|
L30: if(DETAIL < 3)RSPEAK(15);
|
||||||
|
DETAIL=DETAIL+1;
|
||||||
|
WZDARK=FALSE;
|
||||||
|
ABB[LOC]=0;
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
/* CAVE. DIFFERENT MESSAGES DEPENDING ON WHETHER ABOVE GROUND. */
|
||||||
|
|
||||||
|
L40: K=58;
|
||||||
|
if(OUTSID(LOC) && LOC != 8)K=57;
|
||||||
|
RSPEAK(K);
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
/* NON-APPLICABLE MOTION. VARIOUS MESSAGES DEPENDING ON WORD GIVEN. */
|
||||||
|
|
||||||
|
L50: SPK=12;
|
||||||
|
if(K >= 43 && K <= 50)SPK=52;
|
||||||
|
if(K == 29 || K == 30)SPK=52;
|
||||||
|
if(K == 7 || K == 36 || K == 37)SPK=10;
|
||||||
|
if(K == 11 || K == 19)SPK=11;
|
||||||
|
if(VERB == FIND || VERB == INVENT)SPK=59;
|
||||||
|
if(K == 62 || K == 65)SPK=42;
|
||||||
|
if(K == 17)SPK=80;
|
||||||
|
RSPEAK(SPK);
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* "YOU'RE DEAD, JIM."
|
||||||
|
*
|
||||||
|
* IF THE CURRENT LOC IS ZERO, IT MEANS THE CLOWN GOT HIMSELF KILLED. WE'LL
|
||||||
|
* ALLOW THIS MAXDIE TIMES. MAXDIE IS AUTOMATICALLY SET BASED ON THE NUMBER OF
|
||||||
|
* SNIDE MESSAGES AVAILABLE. EACH DEATH RESULTS IN A MESSAGE (81, 83, ETC.)
|
||||||
|
* WHICH OFFERS REINCARNATION; IF ACCEPTED, THIS RESULTS IN MESSAGE 82, 84,
|
||||||
|
* ETC. THE LAST TIME, IF HE WANTS ANOTHER CHANCE, HE GETS A SNIDE REMARK AS
|
||||||
|
* WE EXIT. WHEN REINCARNATED, ALL OBJECTS BEING CARRIED GET DROPPED AT OLDLC2
|
||||||
|
* (PRESUMABLY THE LAST PLACE PRIOR TO BEING KILLED) WITHOUT CHANGE OF PROPS.
|
||||||
|
* THE LOOP RUNS BACKWARDS TO ASSURE THAT THE BIRD IS DROPPED BEFORE THE CAGE.
|
||||||
|
* (THIS KLUGE COULD BE CHANGED ONCE WE'RE SURE ALL REFERENCES TO BIRD AND CAGE
|
||||||
|
* ARE DONE BY KEYWORDS.) THE LAMP IS A SPECIAL CASE (IT WOULDN'T DO TO LEAVE
|
||||||
|
* IT IN THE CAVE). IT IS TURNED OFF AND LEFT OUTSIDE THE BUILDING (ONLY IF HE
|
||||||
|
* WAS CARRYING IT, OF COURSE). HE HIMSELF IS LEFT INSIDE THE BUILDING (AND
|
||||||
|
* HEAVEN HELP HIM IF HE TRIES TO XYZZY BACK INTO THE CAVE WITHOUT THE LAMP!).
|
||||||
|
* OLDLOC IS ZAPPED SO HE CAN'T JUST "RETREAT". */
|
||||||
|
|
||||||
|
/* THE EASIEST WAY TO GET KILLED IS TO FALL INTO A PIT IN PITCH DARKNESS. */
|
||||||
|
|
||||||
|
L90: RSPEAK(23);
|
||||||
|
OLDLC2=LOC;
|
||||||
|
|
||||||
|
/* OKAY, HE'S DEAD. LET'S GET ON WITH IT. */
|
||||||
|
|
||||||
|
L99: if(CLOSNG) goto L95;
|
||||||
|
NUMDIE=NUMDIE+1;
|
||||||
|
if(!YES(79+NUMDIE*2,80+NUMDIE*2,54)) score(0);
|
||||||
|
if(NUMDIE == MAXDIE) score(0);
|
||||||
|
PLACE[WATER]=0;
|
||||||
|
PLACE[OIL]=0;
|
||||||
|
if(TOTING(LAMP))PROP[LAMP]=0;
|
||||||
|
/* 98 */ for (J=1; J<=100; J++) {
|
||||||
|
I=101-J;
|
||||||
|
if(!TOTING(I)) goto L98;
|
||||||
|
K=OLDLC2;
|
||||||
|
if(I == LAMP)K=1;
|
||||||
|
DROP(I,K);
|
||||||
|
L98: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
LOC=3;
|
||||||
|
OLDLOC=LOC;
|
||||||
|
goto L2000;
|
||||||
|
|
||||||
|
/* HE DIED DURING CLOSING TIME. NO RESURRECTION. TALLY UP A DEATH AND EXIT. */
|
||||||
|
|
||||||
|
L95: RSPEAK(131);
|
||||||
|
NUMDIE=NUMDIE+1;
|
||||||
|
score(0);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* HINTS */
|
||||||
|
|
||||||
|
/* COME HERE IF HE'S BEEN LONG ENOUGH AT REQUIRED LOC(S) FOR SOME UNUSED HINT.
|
||||||
|
* HINT NUMBER IS IN VARIABLE "HINT". BRANCH TO QUICK TEST FOR ADDITIONAL
|
||||||
|
* CONDITIONS, THEN COME BACK TO DO NEAT STUFF. GOTO 40010 IF CONDITIONS ARE
|
||||||
|
* MET AND WE WANT TO OFFER THE HINT. GOTO 40020 TO CLEAR HINTLC BACK TO ZERO,
|
||||||
|
* 40030 TO TAKE NO ACTION YET. */
|
||||||
|
|
||||||
|
L40000: switch (HINT-1) { case 0: goto L40100; case 1: goto L40200; case 2: goto
|
||||||
|
L40300; case 3: goto L40400; case 4: goto L40500; case 5: goto
|
||||||
|
L40600; case 6: goto L40700; case 7: goto L40800; case 8: goto
|
||||||
|
L40900; case 9: goto L41000; }
|
||||||
|
/* CAVE BIRD SNAKE MAZE DARK WITT URN WOODS OGRE
|
||||||
|
* JADE */
|
||||||
|
BUG(27);
|
||||||
|
|
||||||
|
L40010: HINTLC[HINT]=0;
|
||||||
|
if(!YES(HINTS[HINT][3],0,54)) goto L2602;
|
||||||
|
SETPRM(1,HINTS[HINT][2],HINTS[HINT][2]);
|
||||||
|
RSPEAK(261);
|
||||||
|
HINTED[HINT]=YES(175,HINTS[HINT][4],54);
|
||||||
|
if(HINTED[HINT] && LIMIT > 30)LIMIT=LIMIT+30*HINTS[HINT][2];
|
||||||
|
L40020: HINTLC[HINT]=0;
|
||||||
|
L40030: goto L2602;
|
||||||
|
|
||||||
|
/* NOW FOR THE QUICK TESTS. SEE DATABASE DESCRIPTION FOR ONE-LINE NOTES. */
|
||||||
|
|
||||||
|
L40100: if(PROP[GRATE] == 0 && !HERE(KEYS)) goto L40010;
|
||||||
|
goto L40020;
|
||||||
|
|
||||||
|
L40200: if(PLACE[BIRD] == LOC && TOTING(ROD) && OLDOBJ == BIRD) goto L40010;
|
||||||
|
goto L40030;
|
||||||
|
|
||||||
|
L40300: if(HERE(SNAKE) && !HERE(BIRD)) goto L40010;
|
||||||
|
goto L40020;
|
||||||
|
|
||||||
|
L40400: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0 && HOLDNG >
|
||||||
|
1) goto L40010;
|
||||||
|
goto L40020;
|
||||||
|
|
||||||
|
L40500: if(PROP[EMRALD] != -1 && PROP[PYRAM] == -1) goto L40010;
|
||||||
|
goto L40020;
|
||||||
|
|
||||||
|
L40600: goto L40010;
|
||||||
|
|
||||||
|
L40700: if(DFLAG == 0) goto L40010;
|
||||||
|
goto L40020;
|
||||||
|
|
||||||
|
L40800: if(ATLOC[LOC] == 0 && ATLOC[OLDLOC] == 0 && ATLOC[OLDLC2] == 0) goto
|
||||||
|
L40010;
|
||||||
|
goto L40030;
|
||||||
|
|
||||||
|
L40900: I=ATDWRF(LOC);
|
||||||
|
if(I < 0) goto L40020;
|
||||||
|
if(HERE(OGRE) && I == 0) goto L40010;
|
||||||
|
goto L40030;
|
||||||
|
|
||||||
|
L41000: if(TALLY == 1 && PROP[JADE] < 0) goto L40010;
|
||||||
|
goto L40020;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* CAVE CLOSING AND SCORING */
|
||||||
|
|
||||||
|
|
||||||
|
/* THESE SECTIONS HANDLE THE CLOSING OF THE CAVE. THE CAVE CLOSES "CLOCK1"
|
||||||
|
* TURNS AFTER THE LAST TREASURE HAS BEEN LOCATED (INCLUDING THE PIRATE'S
|
||||||
|
* CHEST, WHICH MAY OF COURSE NEVER SHOW UP). NOTE THAT THE TREASURES NEED NOT
|
||||||
|
* HAVE BEEN TAKEN YET, JUST LOCATED. HENCE CLOCK1 MUST BE LARGE ENOUGH TO GET
|
||||||
|
* OUT OF THE CAVE (IT ONLY TICKS WHILE INSIDE THE CAVE). WHEN IT HITS ZERO,
|
||||||
|
* WE BRANCH TO 10000 TO START CLOSING THE CAVE, AND THEN SIT BACK AND WAIT FOR
|
||||||
|
* HIM TO TRY TO GET OUT. IF HE DOESN'T WITHIN CLOCK2 TURNS, WE CLOSE THE
|
||||||
|
* CAVE; IF HE DOES TRY, WE ASSUME HE PANICS, AND GIVE HIM A FEW ADDITIONAL
|
||||||
|
* TURNS TO GET FRANTIC BEFORE WE CLOSE. WHEN CLOCK2 HITS ZERO, WE BRANCH TO
|
||||||
|
* 11000 TO TRANSPORT HIM INTO THE FINAL PUZZLE. NOTE THAT THE PUZZLE DEPENDS
|
||||||
|
* UPON ALL SORTS OF RANDOM THINGS. FOR INSTANCE, THERE MUST BE NO WATER OR
|
||||||
|
* OIL, SINCE THERE ARE BEANSTALKS WHICH WE DON'T WANT TO BE ABLE TO WATER,
|
||||||
|
* SINCE THE CODE CAN'T HANDLE IT. ALSO, WE CAN HAVE NO KEYS, SINCE THERE IS A
|
||||||
|
* GRATE (HAVING MOVED THE FIXED OBJECT!) THERE SEPARATING HIM FROM ALL THE
|
||||||
|
* TREASURES. MOST OF THESE PROBLEMS ARISE FROM THE USE OF NEGATIVE PROP
|
||||||
|
* NUMBERS TO SUPPRESS THE OBJECT DESCRIPTIONS UNTIL HE'S ACTUALLY MOVED THE
|
||||||
|
* OBJECTS. */
|
||||||
|
|
||||||
|
/* WHEN THE FIRST WARNING COMES, WE LOCK THE GRATE, DESTROY THE BRIDGE, KILL
|
||||||
|
* ALL THE DWARVES (AND THE PIRATE), REMOVE THE TROLL AND BEAR (UNLESS DEAD),
|
||||||
|
* AND SET "CLOSNG" TO TRUE. LEAVE THE DRAGON; TOO MUCH TROUBLE TO MOVE IT.
|
||||||
|
* FROM NOW UNTIL CLOCK2 RUNS OUT, HE CANNOT UNLOCK THE GRATE, MOVE TO ANY
|
||||||
|
* LOCATION OUTSIDE THE CAVE, OR CREATE THE BRIDGE. NOR CAN HE BE
|
||||||
|
* RESURRECTED IF HE DIES. NOTE THAT THE SNAKE IS ALREADY GONE, SINCE HE GOT
|
||||||
|
* TO THE TREASURE ACCESSIBLE ONLY VIA THE HALL OF THE MT. KING. ALSO, HE'S
|
||||||
|
* BEEN IN GIANT ROOM (TO GET EGGS), SO WE CAN REFER TO IT. ALSO ALSO, HE'S
|
||||||
|
* GOTTEN THE PEARL, SO WE KNOW THE BIVALVE IS AN OYSTER. *AND*, THE DWARVES
|
||||||
|
* MUST HAVE BEEN ACTIVATED, SINCE WE'VE FOUND CHEST. */
|
||||||
|
|
||||||
|
L10000: PROP[GRATE]=0;
|
||||||
|
PROP[FISSUR]=0;
|
||||||
|
/* 10010 */ for (I=1; I<=6; I++) {
|
||||||
|
DSEEN[I]=FALSE;
|
||||||
|
L10010: DLOC[I]=0;
|
||||||
|
} /* end loop */
|
||||||
|
MOVE(TROLL,0);
|
||||||
|
MOVE(TROLL+100,0);
|
||||||
|
MOVE(TROLL2,PLAC[TROLL]);
|
||||||
|
MOVE(TROLL2+100,FIXD[TROLL]);
|
||||||
|
JUGGLE(CHASM);
|
||||||
|
if(PROP[BEAR] != 3)DSTROY(BEAR);
|
||||||
|
PROP[CHAIN]=0;
|
||||||
|
FIXED[CHAIN]=0;
|
||||||
|
PROP[AXE]=0;
|
||||||
|
FIXED[AXE]=0;
|
||||||
|
RSPEAK(129);
|
||||||
|
CLOCK1= -1;
|
||||||
|
CLOSNG=TRUE;
|
||||||
|
goto L19999;
|
||||||
|
|
||||||
|
/* ONCE HE'S PANICKED, AND CLOCK2 HAS RUN OUT, WE COME HERE TO SET UP THE
|
||||||
|
* STORAGE ROOM. THE ROOM HAS TWO LOCS, HARDWIRED AS 115 (NE) AND 116 (SW).
|
||||||
|
* AT THE NE END, WE PLACE EMPTY BOTTLES, A NURSERY OF PLANTS, A BED OF
|
||||||
|
* OYSTERS, A PILE OF LAMPS, RODS WITH STARS, SLEEPING DWARVES, AND HIM. AT
|
||||||
|
* THE SW END WE PLACE GRATE OVER TREASURES, SNAKE PIT, COVEY OF CAGED BIRDS,
|
||||||
|
* MORE RODS, AND PILLOWS. A MIRROR STRETCHES ACROSS ONE WALL. MANY OF THE
|
||||||
|
* OBJECTS COME FROM KNOWN LOCATIONS AND/OR STATES (E.G. THE SNAKE IS KNOWN TO
|
||||||
|
* HAVE BEEN DESTROYED AND NEEDN'T BE CARRIED AWAY FROM ITS OLD "PLACE"),
|
||||||
|
* MAKING THE VARIOUS OBJECTS BE HANDLED DIFFERENTLY. WE ALSO DROP ALL OTHER
|
||||||
|
* OBJECTS HE MIGHT BE CARRYING (LEST HE HAVE SOME WHICH COULD CAUSE TROUBLE,
|
||||||
|
* SUCH AS THE KEYS). WE DESCRIBE THE FLASH OF LIGHT AND TRUNDLE BACK. */
|
||||||
|
|
||||||
|
L11000: PROP[BOTTLE]=PUT(BOTTLE,115,1);
|
||||||
|
PROP[PLANT]=PUT(PLANT,115,0);
|
||||||
|
PROP[OYSTER]=PUT(OYSTER,115,0);
|
||||||
|
OBJTXT[OYSTER]=3;
|
||||||
|
PROP[LAMP]=PUT(LAMP,115,0);
|
||||||
|
PROP[ROD]=PUT(ROD,115,0);
|
||||||
|
PROP[DWARF]=PUT(DWARF,115,0);
|
||||||
|
LOC=115;
|
||||||
|
OLDLOC=115;
|
||||||
|
NEWLOC=115;
|
||||||
|
|
||||||
|
/* LEAVE THE GRATE WITH NORMAL (NON-NEGATIVE) PROPERTY. REUSE SIGN. */
|
||||||
|
|
||||||
|
I=PUT(GRATE,116,0);
|
||||||
|
I=PUT(SIGN,116,0);
|
||||||
|
OBJTXT[SIGN]=OBJTXT[SIGN]+1;
|
||||||
|
PROP[SNAKE]=PUT(SNAKE,116,1);
|
||||||
|
PROP[BIRD]=PUT(BIRD,116,1);
|
||||||
|
PROP[CAGE]=PUT(CAGE,116,0);
|
||||||
|
PROP[ROD2]=PUT(ROD2,116,0);
|
||||||
|
PROP[PILLOW]=PUT(PILLOW,116,0);
|
||||||
|
|
||||||
|
PROP[MIRROR]=PUT(MIRROR,115,0);
|
||||||
|
FIXED[MIRROR]=116;
|
||||||
|
|
||||||
|
/* 11010 */ for (I=1; I<=100; I++) {
|
||||||
|
L11010: if(TOTING(I))DSTROY(I);
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
RSPEAK(132);
|
||||||
|
CLOSED=TRUE;
|
||||||
|
goto L2;
|
||||||
|
|
||||||
|
/* ANOTHER WAY WE CAN FORCE AN END TO THINGS IS BY HAVING THE LAMP GIVE OUT.
|
||||||
|
* WHEN IT GETS CLOSE, WE COME HERE TO WARN HIM. WE GO TO 12000 IF THE LAMP
|
||||||
|
* AND FRESH BATTERIES ARE HERE, IN WHICH CASE WE REPLACE THE BATTERIES AND
|
||||||
|
* CONTINUE. 12200 IS FOR OTHER CASES OF LAMP DYING. 12400 IS WHEN IT GOES
|
||||||
|
* OUT. EVEN THEN, HE CAN EXPLORE OUTSIDE FOR A WHILE IF DESIRED. */
|
||||||
|
|
||||||
|
L12000: RSPEAK(188);
|
||||||
|
PROP[BATTER]=1;
|
||||||
|
if(TOTING(BATTER))DROP(BATTER,LOC);
|
||||||
|
LIMIT=LIMIT+2500;
|
||||||
|
LMWARN=FALSE;
|
||||||
|
goto L19999;
|
||||||
|
|
||||||
|
L12200: if(LMWARN || !HERE(LAMP)) goto L19999;
|
||||||
|
LMWARN=TRUE;
|
||||||
|
SPK=187;
|
||||||
|
if(PLACE[BATTER] == 0)SPK=183;
|
||||||
|
if(PROP[BATTER] == 1)SPK=189;
|
||||||
|
RSPEAK(SPK);
|
||||||
|
goto L19999;
|
||||||
|
|
||||||
|
L12400: LIMIT= -1;
|
||||||
|
PROP[LAMP]=0;
|
||||||
|
if(HERE(LAMP))RSPEAK(184);
|
||||||
|
goto L19999;
|
||||||
|
|
||||||
|
/* OH DEAR, HE'S DISTURBED THE DWARVES. */
|
||||||
|
|
||||||
|
L18999: RSPEAK(SPK);
|
||||||
|
L19000: RSPEAK(136);
|
||||||
|
score(0);
|
||||||
|
}
|
||||||
4
main.h
Normal file
4
main.h
Normal file
|
|
@ -0,0 +1,4 @@
|
||||||
|
extern long ABB[], ATAB[], ATLOC[], BLKLIN, DFLAG, DLOC[], FIXED[], HOLDNG,
|
||||||
|
KTAB[], *LINES, LINK[], LNLENG, LNPOSN,
|
||||||
|
PARMS[], PLACE[], PTEXT[], RTEXT[], TABSIZ;
|
||||||
|
extern signed char INLINE[], MAP1[], MAP2[];
|
||||||
78
misc.h
Normal file
78
misc.h
Normal file
|
|
@ -0,0 +1,78 @@
|
||||||
|
#ifdef __MSDOS__ /* define fopen modes for binary files */
|
||||||
|
#define READ_MODE "rb"
|
||||||
|
#define WRITE_MODE "wb"
|
||||||
|
#else
|
||||||
|
#define READ_MODE "r"
|
||||||
|
#define WRITE_MODE "w"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
extern void fSPEAK(long);
|
||||||
|
#define SPEAK(N) fSPEAK(N)
|
||||||
|
extern void fPSPEAK(long,long);
|
||||||
|
#define PSPEAK(MSG,SKIP) fPSPEAK(MSG,SKIP)
|
||||||
|
extern void fRSPEAK(long);
|
||||||
|
#define RSPEAK(I) fRSPEAK(I)
|
||||||
|
extern void fSETPRM(long,long,long);
|
||||||
|
#define SETPRM(FIRST,P1,P2) fSETPRM(FIRST,P1,P2)
|
||||||
|
extern void fGETIN(long*,long*,long*,long*);
|
||||||
|
#define GETIN(WORD1,WORD1X,WORD2,WORD2X) fGETIN(&WORD1,&WORD1X,&WORD2,&WORD2X)
|
||||||
|
extern long fYES(long,long,long);
|
||||||
|
#define YES(X,Y,Z) fYES(X,Y,Z)
|
||||||
|
extern long fGETNUM(long);
|
||||||
|
#define GETNUM(K) fGETNUM(K)
|
||||||
|
extern long fGETTXT(long,long,long,long);
|
||||||
|
#define GETTXT(SKIP,ONEWRD,UPPER,HASH) fGETTXT(SKIP,ONEWRD,UPPER,HASH)
|
||||||
|
extern long fMAKEWD(long);
|
||||||
|
#define MAKEWD(LETTRS) fMAKEWD(LETTRS)
|
||||||
|
extern void fPUTTXT(long,long*,long,long);
|
||||||
|
#define PUTTXT(WORD,STATE,CASE,HASH) fPUTTXT(WORD,&STATE,CASE,HASH)
|
||||||
|
extern void fSHFTXT(long,long);
|
||||||
|
#define SHFTXT(FROM,DELTA) fSHFTXT(FROM,DELTA)
|
||||||
|
extern void fTYPE0();
|
||||||
|
#define TYPE0() fTYPE0()
|
||||||
|
extern void fSAVWDS(long*,long*,long*,long*,long*,long*,long*);
|
||||||
|
#define SAVWDS(W1,W2,W3,W4,W5,W6,W7) fSAVWDS(&W1,&W2,&W3,&W4,&W5,&W6,&W7)
|
||||||
|
extern void fSAVARR(long*,long);
|
||||||
|
#define SAVARR(ARR,N) fSAVARR(ARR,N)
|
||||||
|
extern void fSAVWRD(long,long*);
|
||||||
|
#define SAVWRD(OP,WORD) fSAVWRD(OP,&WORD)
|
||||||
|
extern long fVOCAB(long,long);
|
||||||
|
#define VOCAB(ID,INIT) fVOCAB(ID,INIT)
|
||||||
|
extern void fDSTROY(long);
|
||||||
|
#define DSTROY(OBJECT) fDSTROY(OBJECT)
|
||||||
|
extern void fJUGGLE(long);
|
||||||
|
#define JUGGLE(OBJECT) fJUGGLE(OBJECT)
|
||||||
|
extern void fMOVE(long,long);
|
||||||
|
#define MOVE(OBJECT,WHERE) fMOVE(OBJECT,WHERE)
|
||||||
|
extern long fPUT(long,long,long);
|
||||||
|
#define PUT(OBJECT,WHERE,PVAL) fPUT(OBJECT,WHERE,PVAL)
|
||||||
|
extern void fCARRY(long,long);
|
||||||
|
#define CARRY(OBJECT,WHERE) fCARRY(OBJECT,WHERE)
|
||||||
|
extern void fDROP(long,long);
|
||||||
|
#define DROP(OBJECT,WHERE) fDROP(OBJECT,WHERE)
|
||||||
|
extern long fATDWRF(long);
|
||||||
|
#define ATDWRF(WHERE) fATDWRF(WHERE)
|
||||||
|
extern long fSETBIT(long);
|
||||||
|
#define SETBIT(BIT) fSETBIT(BIT)
|
||||||
|
extern long fTSTBIT(long,long);
|
||||||
|
#define TSTBIT(MASK,BIT) fTSTBIT(MASK,BIT)
|
||||||
|
extern long fRAN(long);
|
||||||
|
#define RAN(RANGE) fRAN(RANGE)
|
||||||
|
extern long fRNDVOC(long,long);
|
||||||
|
#define RNDVOC(CHAR,FORCE) fRNDVOC(CHAR,FORCE)
|
||||||
|
extern void fBUG(long);
|
||||||
|
#define BUG(NUM) fBUG(NUM)
|
||||||
|
extern void fMAPLIN(long);
|
||||||
|
#define MAPLIN(FIL) fMAPLIN(FIL)
|
||||||
|
extern void fTYPE();
|
||||||
|
#define TYPE() fTYPE()
|
||||||
|
extern void fMPINIT();
|
||||||
|
#define MPINIT() fMPINIT()
|
||||||
|
extern void fSAVEIO(long,long,long*);
|
||||||
|
#define SAVEIO(OP,IN,ARR) fSAVEIO(OP,IN,ARR)
|
||||||
|
extern void fDATIME(long*,long*);
|
||||||
|
#define DATIME(D,T) fDATIME(&D,&T)
|
||||||
|
extern long fIABS(long);
|
||||||
|
#define IABS(N) fIABS(N)
|
||||||
|
extern long fMOD(long,long);
|
||||||
|
#define MOD(N,M) fMOD(N,M)
|
||||||
119
score.c
Normal file
119
score.c
Normal file
|
|
@ -0,0 +1,119 @@
|
||||||
|
#include "misc.h"
|
||||||
|
#include "main.h"
|
||||||
|
#include "share.h"
|
||||||
|
|
||||||
|
#define TRUE (0==0)
|
||||||
|
#define FALSE (0!=0)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* SCORING AND WRAP-UP
|
||||||
|
*/
|
||||||
|
|
||||||
|
void score(MODE)long MODE; {
|
||||||
|
/* <0 if scoring, >0 if quitting, =0 if died or won */
|
||||||
|
|
||||||
|
/* THE PRESENT SCORING ALGORITHM IS AS FOLLOWS:
|
||||||
|
* OBJECTIVE: POINTS: PRESENT TOTAL POSSIBLE:
|
||||||
|
* GETTING WELL INTO CAVE 25 25
|
||||||
|
* EACH TREASURE < CHEST 12 60
|
||||||
|
* TREASURE CHEST ITSELF 14 14
|
||||||
|
* EACH TREASURE > CHEST 16 224
|
||||||
|
* SURVIVING (MAX-NUM)*10 30
|
||||||
|
* NOT QUITTING 4 4
|
||||||
|
* REACHING "CLOSNG" 25 25
|
||||||
|
* "CLOSED": QUIT/KILLED 10
|
||||||
|
* KLUTZED 25
|
||||||
|
* WRONG WAY 30
|
||||||
|
* SUCCESS 45 45
|
||||||
|
* CAME TO WITT'S END 1 1
|
||||||
|
* ROUND OUT THE TOTAL 2 2
|
||||||
|
* TOTAL: 430
|
||||||
|
* POINTS CAN ALSO BE DEDUCTED FOR USING HINTS OR TOO MANY TURNS, OR FOR
|
||||||
|
* SAVING INTERMEDIATE POSITIONS. */
|
||||||
|
|
||||||
|
L20000: SCORE=0;
|
||||||
|
MXSCOR=0;
|
||||||
|
|
||||||
|
/* FIRST TALLY UP THE TREASURES. MUST BE IN BUILDING AND NOT BROKEN.
|
||||||
|
* GIVE THE POOR GUY 2 POINTS JUST FOR FINDING EACH TREASURE. */
|
||||||
|
|
||||||
|
/* 20010 */ for (I=50; I<=MAXTRS; I++) {
|
||||||
|
if(PTEXT[I] == 0) goto L20010;
|
||||||
|
K=12;
|
||||||
|
if(I == CHEST)K=14;
|
||||||
|
if(I > CHEST)K=16;
|
||||||
|
if(PROP[I] >= 0)SCORE=SCORE+2;
|
||||||
|
if(PLACE[I] == 3 && PROP[I] == 0)SCORE=SCORE+K-2;
|
||||||
|
MXSCOR=MXSCOR+K;
|
||||||
|
L20010: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
|
||||||
|
/* NOW LOOK AT HOW HE FINISHED AND HOW FAR HE GOT. MAXDIE AND NUMDIE TELL US
|
||||||
|
* HOW WELL HE SURVIVED. DFLAG WILL
|
||||||
|
* TELL US IF HE EVER GOT SUITABLY DEEP INTO THE CAVE. CLOSNG STILL INDICATES
|
||||||
|
* WHETHER HE REACHED THE ENDGAME. AND IF HE GOT AS FAR AS "CAVE CLOSED"
|
||||||
|
* (INDICATED BY "CLOSED"), THEN BONUS IS ZERO FOR MUNDANE EXITS OR 133, 134,
|
||||||
|
* 135 IF HE BLEW IT (SO TO SPEAK). */
|
||||||
|
|
||||||
|
SCORE=SCORE+(MAXDIE-NUMDIE)*10;
|
||||||
|
MXSCOR=MXSCOR+MAXDIE*10;
|
||||||
|
if(MODE == 0)SCORE=SCORE+4;
|
||||||
|
MXSCOR=MXSCOR+4;
|
||||||
|
if(DFLAG != 0)SCORE=SCORE+25;
|
||||||
|
MXSCOR=MXSCOR+25;
|
||||||
|
if(CLOSNG)SCORE=SCORE+25;
|
||||||
|
MXSCOR=MXSCOR+25;
|
||||||
|
if(!CLOSED) goto L20020;
|
||||||
|
if(BONUS == 0)SCORE=SCORE+10;
|
||||||
|
if(BONUS == 135)SCORE=SCORE+25;
|
||||||
|
if(BONUS == 134)SCORE=SCORE+30;
|
||||||
|
if(BONUS == 133)SCORE=SCORE+45;
|
||||||
|
L20020: MXSCOR=MXSCOR+45;
|
||||||
|
|
||||||
|
/* DID HE COME TO WITT'S END AS HE SHOULD? */
|
||||||
|
|
||||||
|
if(PLACE[MAGZIN] == 108)SCORE=SCORE+1;
|
||||||
|
MXSCOR=MXSCOR+1;
|
||||||
|
|
||||||
|
/* ROUND IT OFF. */
|
||||||
|
|
||||||
|
SCORE=SCORE+2;
|
||||||
|
MXSCOR=MXSCOR+2;
|
||||||
|
|
||||||
|
/* DEDUCT FOR HINTS/TURNS/SAVES. HINTS < 4 ARE SPECIAL; SEE DATABASE DESC. */
|
||||||
|
|
||||||
|
/* 20030 */ for (I=1; I<=HNTMAX; I++) {
|
||||||
|
L20030: if(HINTED[I])SCORE=SCORE-HINTS[I][2];
|
||||||
|
} /* end loop */
|
||||||
|
if(NOVICE)SCORE=SCORE-5;
|
||||||
|
if(CLSHNT)SCORE=SCORE-10;
|
||||||
|
SCORE=SCORE-TRNLUZ-SAVED;
|
||||||
|
|
||||||
|
/* RETURN TO SCORE COMMAND IF THAT'S WHERE WE CAME FROM. */
|
||||||
|
|
||||||
|
if(MODE < 0) return;
|
||||||
|
|
||||||
|
/* THAT SHOULD BE GOOD ENOUGH. LET'S TELL HIM ALL ABOUT IT. */
|
||||||
|
|
||||||
|
if(SCORE+TRNLUZ+1 >= MXSCOR && TRNLUZ != 0)RSPEAK(242);
|
||||||
|
if(SCORE+SAVED+1 >= MXSCOR && SAVED != 0)RSPEAK(143);
|
||||||
|
SETPRM(1,SCORE,MXSCOR);
|
||||||
|
SETPRM(3,TURNS,TURNS);
|
||||||
|
RSPEAK(262);
|
||||||
|
/* 20200 */ for (I=1; I<=CLSSES; I++) {
|
||||||
|
if(CVAL[I] >= SCORE) goto L20210;
|
||||||
|
L20200: /*etc*/ ;
|
||||||
|
} /* end loop */
|
||||||
|
SPK=265;
|
||||||
|
goto L25000;
|
||||||
|
|
||||||
|
L20210: SPEAK(CTEXT[I]);
|
||||||
|
SPK=264;
|
||||||
|
if(I >= CLSSES) goto L25000;
|
||||||
|
I=CVAL[I]+1-SCORE;
|
||||||
|
SETPRM(1,I,I);
|
||||||
|
SPK=263;
|
||||||
|
L25000: RSPEAK(SPK);
|
||||||
|
exit(FALSE);
|
||||||
|
|
||||||
|
}
|
||||||
24
share.h
Normal file
24
share.h
Normal file
|
|
@ -0,0 +1,24 @@
|
||||||
|
extern void score(long);
|
||||||
|
extern long ABBNUM, ACTSPK[], AMBER, ATTACK, AXE, BACK, BATTER, BEAR,
|
||||||
|
BIRD, BLOOD, BONUS,
|
||||||
|
BOTTLE, CAGE, CAVE, CAVITY, CHAIN, CHASM, CHEST, CHLOC, CHLOC2,
|
||||||
|
CLAM, CLOCK1, CLOCK2, CLOSED, CLOSNG, CLSHNT, CLSMAX, CLSSES,
|
||||||
|
COINS, COND[], CONDS, CTEXT[], CVAL[], DALTLC, DETAIL,
|
||||||
|
DKILL, DOOR, DPRSSN, DRAGON, DSEEN[], DTOTAL, DWARF, EGGS,
|
||||||
|
EMRALD, ENTER, ENTRNC, FIND, FISSUR, FIXD[], FOOBAR, FOOD,
|
||||||
|
GRATE, HINT, HINTED[], HINTLC[], HINTS[][5], HNTMAX,
|
||||||
|
HNTSIZ, I, INVENT, IGO, IWEST, J, JADE, K, K2, KEY[], KEYS, KK,
|
||||||
|
KNFLOC, KNIFE, KQ, L, LAMP, LIMIT, LINSIZ, LINUSE, LL,
|
||||||
|
LMWARN, LOC, LOCK, LOCSIZ, LOCSND[], LOOK, LTEXT[],
|
||||||
|
MAGZIN, MAXDIE, MAXTRS, MESH, MESSAG, MIRROR, MXSCOR,
|
||||||
|
NEWLOC, NOVICE, NUGGET, NUL, NUMDIE, OBJ, OBJSND[],
|
||||||
|
OBJTXT[], ODLOC[], OGRE, OIL, OLDLC2, OLDLOC, OLDOBJ, OYSTER,
|
||||||
|
PANIC, PEARL, PILLOW, PLAC[], PLANT, PLANT2, PROP[], PYRAM,
|
||||||
|
RESER, ROD, ROD2, RTXSIZ, RUBY, RUG, SAPPH, SAVED, SAY,
|
||||||
|
SCORE, SECT, SETUP, SIGN, SNAKE, SPK, STEPS, STEXT[], STICK,
|
||||||
|
STREAM, TABNDX, TALLY, THRESH, THROW, TK[], TRAVEL[], TRIDNT,
|
||||||
|
TRNDEX, TRNLUZ, TRNSIZ, TRNVAL[], TRNVLS, TROLL, TROLL2, TRVS,
|
||||||
|
TRVSIZ, TTEXT[], TURNS, URN, V1, V2, VASE, VEND, VERB,
|
||||||
|
VOLCAN, VRBSIZ, VRSION, WATER, WD1, WD1X, WD2, WD2X,
|
||||||
|
WZDARK, ZZWORD;
|
||||||
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue