dverb2.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689
  1. /* SAVE- SAVE GAME STATE */
  2. /*COPYRIGHT 1980, INFOCOM COMPUTERS AND COMMUNICATIONS, CAMBRIDGE MA. 02142*/
  3. /* ALL RIGHTS RESERVED, COMMERCIAL USAGE STRICTLY PROHIBITED */
  4. /* WRITTEN BY R. M. SUPNIK */
  5. #include <stdio.h>
  6. #include "funcs.h"
  7. #include "vars.h"
  8. /* DECLARATIONS */
  9. static integer cxappl_ P((integer));
  10. void savegm_()
  11. {
  12. /* Local variables */
  13. integer i;
  14. FILE *e;
  15. prsvec_1.prswon = FALSE_;
  16. /* !DISABLE GAME. */
  17. /* Note: save file format is different for PDP vs. non-PDP versions */
  18. if ((e = fopen("dsave.dat", BINWRITE)) == NULL)
  19. goto L100;
  20. gttime_(&i);
  21. /* !GET TIME. */
  22. #define do_uio(i, zbuf, cbytes) \
  23. (void) fwrite((const char *)(zbuf), (cbytes), (i), e)
  24. do_uio(1, &vers_1.vmaj, sizeof(integer));
  25. do_uio(1, &vers_1.vmin, sizeof(integer));
  26. do_uio(1, &vers_1.vedit, sizeof(integer));
  27. do_uio(1, &play_1.winner, sizeof(integer));
  28. do_uio(1, &play_1.here, sizeof(integer));
  29. do_uio(1, &hack_1.thfpos, sizeof(integer));
  30. do_uio(1, &play_1.telflg, sizeof(logical));
  31. do_uio(1, &hack_1.thfflg, sizeof(logical));
  32. do_uio(1, &hack_1.thfact, sizeof(logical));
  33. do_uio(1, &hack_1.swdact, sizeof(logical));
  34. do_uio(1, &hack_1.swdsta, sizeof(integer));
  35. do_uio(64, &puzzle_1.cpvec[0], sizeof(integer));
  36. do_uio(1, &i, sizeof(integer));
  37. do_uio(1, &state_1.moves, sizeof(integer));
  38. do_uio(1, &state_1.deaths, sizeof(integer));
  39. do_uio(1, &state_1.rwscor, sizeof(integer));
  40. do_uio(1, &state_1.egscor, sizeof(integer));
  41. do_uio(1, &state_1.mxload, sizeof(integer));
  42. do_uio(1, &state_1.ltshft, sizeof(integer));
  43. do_uio(1, &state_1.bloc, sizeof(integer));
  44. do_uio(1, &state_1.mungrm, sizeof(integer));
  45. do_uio(1, &state_1.hs, sizeof(integer));
  46. do_uio(1, &screen_1.fromdr, sizeof(integer));
  47. do_uio(1, &screen_1.scolrm, sizeof(integer));
  48. do_uio(1, &screen_1.scolac, sizeof(integer));
  49. do_uio(220, &objcts_1.odesc1[0], sizeof(integer));
  50. do_uio(220, &objcts_1.odesc2[0], sizeof(integer));
  51. do_uio(220, &objcts_1.oflag1[0], sizeof(integer));
  52. do_uio(220, &objcts_1.oflag2[0], sizeof(integer));
  53. do_uio(220, &objcts_1.ofval[0], sizeof(integer));
  54. do_uio(220, &objcts_1.otval[0], sizeof(integer));
  55. do_uio(220, &objcts_1.osize[0], sizeof(integer));
  56. do_uio(220, &objcts_1.ocapac[0], sizeof(integer));
  57. do_uio(220, &objcts_1.oroom[0], sizeof(integer));
  58. do_uio(220, &objcts_1.oadv[0], sizeof(integer));
  59. do_uio(220, &objcts_1.ocan[0], sizeof(integer));
  60. do_uio(200, &rooms_1.rval[0], sizeof(integer));
  61. do_uio(200, &rooms_1.rflag[0], sizeof(integer));
  62. do_uio(4, &advs_1.aroom[0], sizeof(integer));
  63. do_uio(4, &advs_1.ascore[0], sizeof(integer));
  64. do_uio(4, &advs_1.avehic[0], sizeof(integer));
  65. do_uio(4, &advs_1.astren[0], sizeof(integer));
  66. do_uio(4, &advs_1.aflag[0], sizeof(integer));
  67. do_uio(46, &flags[0], sizeof(logical));
  68. do_uio(22, &switch_[0], sizeof(integer));
  69. do_uio(4, &vill_1.vprob[0], sizeof(integer));
  70. do_uio(25, &cevent_1.cflag[0], sizeof(logical));
  71. do_uio(25, &cevent_1.ctick[0], sizeof(integer));
  72. #undef do_uio
  73. if (fclose(e) == EOF)
  74. goto L100;
  75. rspeak_(597);
  76. return;
  77. L100:
  78. rspeak_(598);
  79. /* !CANT DO IT. */
  80. } /* savegm_ */
  81. /* RESTORE- RESTORE GAME STATE */
  82. /* DECLARATIONS */
  83. void rstrgm_()
  84. {
  85. /* Local variables */
  86. integer i, j, k;
  87. FILE *e;
  88. prsvec_1.prswon = FALSE_;
  89. /* !DISABLE GAME. */
  90. /* Note: save file format is different for PDP vs. non-PDP versions */
  91. if ((e = fopen("dsave.dat", BINREAD)) == NULL)
  92. goto L100;
  93. #define do_uio(i, zbuf, cbytes) \
  94. (void)fread((char *)(zbuf), (cbytes), (i), e)
  95. do_uio(1, &i, sizeof(integer));
  96. do_uio(1, &j, sizeof(integer));
  97. do_uio(1, &k, sizeof(integer));
  98. if (i != vers_1.vmaj | j != vers_1.vmin) {
  99. goto L200;
  100. }
  101. do_uio(1, &play_1.winner, sizeof(integer));
  102. do_uio(1, &play_1.here, sizeof(integer));
  103. do_uio(1, &hack_1.thfpos, sizeof(integer));
  104. do_uio(1, &play_1.telflg, sizeof(logical));
  105. do_uio(1, &hack_1.thfflg, sizeof(logical));
  106. do_uio(1, &hack_1.thfact, sizeof(logical));
  107. do_uio(1, &hack_1.swdact, sizeof(logical));
  108. do_uio(1, &hack_1.swdsta, sizeof(integer));
  109. do_uio(64, &puzzle_1.cpvec[0], sizeof(integer));
  110. do_uio(1, &time_1.pltime, sizeof(integer));
  111. do_uio(1, &state_1.moves, sizeof(integer));
  112. do_uio(1, &state_1.deaths, sizeof(integer));
  113. do_uio(1, &state_1.rwscor, sizeof(integer));
  114. do_uio(1, &state_1.egscor, sizeof(integer));
  115. do_uio(1, &state_1.mxload, sizeof(integer));
  116. do_uio(1, &state_1.ltshft, sizeof(integer));
  117. do_uio(1, &state_1.bloc, sizeof(integer));
  118. do_uio(1, &state_1.mungrm, sizeof(integer));
  119. do_uio(1, &state_1.hs, sizeof(integer));
  120. do_uio(1, &screen_1.fromdr, sizeof(integer));
  121. do_uio(1, &screen_1.scolrm, sizeof(integer));
  122. do_uio(1, &screen_1.scolac, sizeof(integer));
  123. do_uio(220, &objcts_1.odesc1[0], sizeof(integer));
  124. do_uio(220, &objcts_1.odesc2[0], sizeof(integer));
  125. do_uio(220, &objcts_1.oflag1[0], sizeof(integer));
  126. do_uio(220, &objcts_1.oflag2[0], sizeof(integer));
  127. do_uio(220, &objcts_1.ofval[0], sizeof(integer));
  128. do_uio(220, &objcts_1.otval[0], sizeof(integer));
  129. do_uio(220, &objcts_1.osize[0], sizeof(integer));
  130. do_uio(220, &objcts_1.ocapac[0], sizeof(integer));
  131. do_uio(220, &objcts_1.oroom[0], sizeof(integer));
  132. do_uio(220, &objcts_1.oadv[0], sizeof(integer));
  133. do_uio(220, &objcts_1.ocan[0], sizeof(integer));
  134. do_uio(200, &rooms_1.rval[0], sizeof(integer));
  135. do_uio(200, &rooms_1.rflag[0], sizeof(integer));
  136. do_uio(4, &advs_1.aroom[0], sizeof(integer));
  137. do_uio(4, &advs_1.ascore[0], sizeof(integer));
  138. do_uio(4, &advs_1.avehic[0], sizeof(integer));
  139. do_uio(4, &advs_1.astren[0], sizeof(integer));
  140. do_uio(4, &advs_1.aflag[0], sizeof(integer));
  141. do_uio(46, &flags[0], sizeof(logical));
  142. do_uio(22, &switch_[0], sizeof(integer));
  143. do_uio(4, &vill_1.vprob[0], sizeof(integer));
  144. do_uio(25, &cevent_1.cflag[0], sizeof(logical));
  145. do_uio(25, &cevent_1.ctick[0], sizeof(integer));
  146. (void)fclose(e);
  147. rspeak_(599);
  148. return;
  149. L100:
  150. rspeak_(598);
  151. /* !CANT DO IT. */
  152. return;
  153. L200:
  154. rspeak_(600);
  155. /* !OBSOLETE VERSION */
  156. (void)fclose(e);
  157. } /* rstrgm_ */
  158. /* WALK- MOVE IN SPECIFIED DIRECTION */
  159. /* DECLARATIONS */
  160. logical walk_()
  161. {
  162. /* System generated locals */
  163. logical ret_val;
  164. ret_val = TRUE_;
  165. /* !ASSUME WINS. */
  166. if (play_1.winner != aindex_1.player || lit_(play_1.here) || prob_(25,
  167. 25)) {
  168. goto L500;
  169. }
  170. if (! findxt_(prsvec_1.prso, play_1.here)) {
  171. goto L450;
  172. }
  173. /* !INVALID EXIT? GRUE */
  174. /* ! */
  175. switch (curxt_1.xtype) {
  176. case 1: goto L400;
  177. case 2: goto L200;
  178. case 3: goto L100;
  179. case 4: goto L300;
  180. }
  181. /* !DECODE EXIT TYPE. */
  182. bug_(9, curxt_1.xtype);
  183. L100:
  184. if (cxappl_(curxt_1.xactio) != 0) {
  185. goto L400;
  186. }
  187. /* !CEXIT... RETURNED ROOM? */
  188. if (flags[*xflag - 1]) {
  189. goto L400;
  190. }
  191. /* !NO, FLAG ON? */
  192. L200:
  193. jigsup_(523);
  194. /* !BAD EXIT, GRUE */
  195. /* ! */
  196. return ret_val;
  197. L300:
  198. if (cxappl_(curxt_1.xactio) != 0) {
  199. goto L400;
  200. }
  201. /* !DOOR... RETURNED ROOM? */
  202. if ((objcts_1.oflag2[curxt_1.xobj - 1] & OPENBT) != 0) {
  203. goto L400;
  204. }
  205. /* !NO, DOOR OPEN? */
  206. jigsup_(523);
  207. /* !BAD EXIT, GRUE */
  208. /* ! */
  209. return ret_val;
  210. L400:
  211. if (lit_(curxt_1.xroom1)) {
  212. goto L900;
  213. }
  214. /* !VALID ROOM, IS IT LIT? */
  215. L450:
  216. jigsup_(522);
  217. /* !NO, GRUE */
  218. /* ! */
  219. return ret_val;
  220. /* ROOM IS LIT, OR WINNER IS NOT PLAYER (NO GRUE). */
  221. L500:
  222. if (findxt_(prsvec_1.prso, play_1.here)) {
  223. goto L550;
  224. }
  225. /* !EXIT EXIST? */
  226. L525:
  227. curxt_1.xstrng = 678;
  228. /* !ASSUME WALL. */
  229. if (prsvec_1.prso == xsrch_1.xup) {
  230. curxt_1.xstrng = 679;
  231. }
  232. /* !IF UP, CANT. */
  233. if (prsvec_1.prso == xsrch_1.xdown) {
  234. curxt_1.xstrng = 680;
  235. }
  236. /* !IF DOWN, CANT. */
  237. if ((rooms_1.rflag[play_1.here - 1] & RNWALL) != 0) {
  238. curxt_1.xstrng = 524;
  239. }
  240. rspeak_(curxt_1.xstrng);
  241. prsvec_1.prscon = 1;
  242. /* !STOP CMD STREAM. */
  243. return ret_val;
  244. L550:
  245. switch (curxt_1.xtype) {
  246. case 1: goto L900;
  247. case 2: goto L600;
  248. case 3: goto L700;
  249. case 4: goto L800;
  250. }
  251. /* !BRANCH ON EXIT TYPE. */
  252. bug_(9, curxt_1.xtype);
  253. L700:
  254. if (cxappl_(curxt_1.xactio) != 0) {
  255. goto L900;
  256. }
  257. /* !CEXIT... RETURNED ROOM? */
  258. if (flags[*xflag - 1]) {
  259. goto L900;
  260. }
  261. /* !NO, FLAG ON? */
  262. L600:
  263. if (curxt_1.xstrng == 0) {
  264. goto L525;
  265. }
  266. /* !IF NO REASON, USE STD. */
  267. rspeak_(curxt_1.xstrng);
  268. /* !DENY EXIT. */
  269. prsvec_1.prscon = 1;
  270. /* !STOP CMD STREAM. */
  271. return ret_val;
  272. L800:
  273. if (cxappl_(curxt_1.xactio) != 0) {
  274. goto L900;
  275. }
  276. /* !DOOR... RETURNED ROOM? */
  277. if ((objcts_1.oflag2[curxt_1.xobj - 1] & OPENBT) != 0) {
  278. goto L900;
  279. }
  280. /* !NO, DOOR OPEN? */
  281. if (curxt_1.xstrng == 0) {
  282. curxt_1.xstrng = 525;
  283. }
  284. /* !IF NO REASON, USE STD. */
  285. rspsub_(curxt_1.xstrng, objcts_1.odesc2[curxt_1.xobj - 1]);
  286. prsvec_1.prscon = 1;
  287. /* !STOP CMD STREAM. */
  288. return ret_val;
  289. L900:
  290. ret_val = moveto_(curxt_1.xroom1, play_1.winner);
  291. /* !MOVE TO ROOM. */
  292. if (ret_val) {
  293. ret_val = rmdesc_(0);
  294. }
  295. /* !DESCRIBE ROOM. */
  296. return ret_val;
  297. } /* walk_ */
  298. /* CXAPPL- CONDITIONAL EXIT PROCESSORS */
  299. /* DECLARATIONS */
  300. static integer cxappl_(ri)
  301. integer ri;
  302. {
  303. /* System generated locals */
  304. integer ret_val, i__1;
  305. /* Local variables */
  306. integer i, j, k;
  307. integer nxt;
  308. integer ldir;
  309. ret_val = 0;
  310. /* !NO RETURN. */
  311. if (ri == 0) {
  312. return ret_val;
  313. }
  314. /* !IF NO ACTION, DONE. */
  315. switch (ri) {
  316. case 1: goto L1000;
  317. case 2: goto L2000;
  318. case 3: goto L3000;
  319. case 4: goto L4000;
  320. case 5: goto L5000;
  321. case 6: goto L6000;
  322. case 7: goto L7000;
  323. case 8: goto L8000;
  324. case 9: goto L9000;
  325. case 10: goto L10000;
  326. case 11: goto L11000;
  327. case 12: goto L12000;
  328. case 13: goto L13000;
  329. case 14: goto L14000;
  330. }
  331. bug_(5, ri);
  332. /* C1- COFFIN-CURE */
  333. L1000:
  334. findex_1.egyptf = objcts_1.oadv[oindex_1.coffi - 1] != play_1.winner;
  335. /* !T IF NO COFFIN. */
  336. return ret_val;
  337. /* C2- CAROUSEL EXIT */
  338. /* C5- CAROUSEL OUT */
  339. L2000:
  340. if (findex_1.caroff) {
  341. return ret_val;
  342. }
  343. /* !IF FLIPPED, NOTHING. */
  344. L2500:
  345. rspeak_(121);
  346. /* !SPIN THE COMPASS. */
  347. L5000:
  348. i = xpars_1.xelnt[xpars_1.xcond - 1] * rnd_(8);
  349. /* !CHOOSE RANDOM EXIT. */
  350. curxt_1.xroom1 = exits_1.travel[rooms_1.rexit[play_1.here - 1] + i - 1] &
  351. xpars_1.xrmask;
  352. ret_val = curxt_1.xroom1;
  353. /* !RETURN EXIT. */
  354. return ret_val;
  355. /* C3- CHIMNEY FUNCTION */
  356. L3000:
  357. findex_1.litldf = FALSE_;
  358. /* !ASSUME HEAVY LOAD. */
  359. j = 0;
  360. i__1 = objcts_1.olnt;
  361. for (i = 1; i <= i__1; ++i) {
  362. /* !COUNT OBJECTS. */
  363. if (objcts_1.oadv[i - 1] == play_1.winner) {
  364. ++j;
  365. }
  366. /* L3100: */
  367. }
  368. if (j > 2) {
  369. return ret_val;
  370. }
  371. /* !CARRYING TOO MUCH? */
  372. curxt_1.xstrng = 446;
  373. /* !ASSUME NO LAMP. */
  374. if (objcts_1.oadv[oindex_1.lamp - 1] != play_1.winner) {
  375. return ret_val;
  376. }
  377. /* !NO LAMP? */
  378. findex_1.litldf = TRUE_;
  379. /* !HE CAN DO IT. */
  380. if ((objcts_1.oflag2[oindex_1.door - 1] & OPENBT) == 0) {
  381. objcts_1.oflag2[oindex_1.door - 1] &= ~ TCHBT;
  382. }
  383. return ret_val;
  384. /* C4- FROBOZZ FLAG (MAGNET ROOM, FAKE EXIT) */
  385. /* C6- FROBOZZ FLAG (MAGNET ROOM, REAL EXIT) */
  386. L4000:
  387. if (findex_1.caroff) {
  388. goto L2500;
  389. }
  390. /* !IF FLIPPED, GO SPIN. */
  391. findex_1.frobzf = FALSE_;
  392. /* !OTHERWISE, NOT AN EXIT. */
  393. return ret_val;
  394. L6000:
  395. if (findex_1.caroff) {
  396. goto L2500;
  397. }
  398. /* !IF FLIPPED, GO SPIN. */
  399. findex_1.frobzf = TRUE_;
  400. /* !OTHERWISE, AN EXIT. */
  401. return ret_val;
  402. /* C7- FROBOZZ FLAG (BANK ALARM) */
  403. L7000:
  404. findex_1.frobzf = objcts_1.oroom[oindex_1.bills - 1] != 0 &
  405. objcts_1.oroom[oindex_1.portr - 1] != 0;
  406. return ret_val;
  407. /* CXAPPL, PAGE 3 */
  408. /* C8- FROBOZZ FLAG (MRGO) */
  409. L8000:
  410. findex_1.frobzf = FALSE_;
  411. /* !ASSUME CANT MOVE. */
  412. if (findex_1.mloc != curxt_1.xroom1) {
  413. goto L8100;
  414. }
  415. /* !MIRROR IN WAY? */
  416. if (prsvec_1.prso == xsrch_1.xnorth || prsvec_1.prso == xsrch_1.xsouth) {
  417. goto L8200;
  418. }
  419. if (findex_1.mdir % 180 != 0) {
  420. goto L8300;
  421. }
  422. /* !MIRROR MUST BE N-S. */
  423. curxt_1.xroom1 = (curxt_1.xroom1 - rindex_1.mra << 1) + rindex_1.mrae;
  424. /* !CALC EAST ROOM. */
  425. if (prsvec_1.prso > xsrch_1.xsouth) {
  426. ++curxt_1.xroom1;
  427. }
  428. /* !IF SW/NW, CALC WEST. */
  429. L8100:
  430. ret_val = curxt_1.xroom1;
  431. return ret_val;
  432. L8200:
  433. curxt_1.xstrng = 814;
  434. /* !ASSUME STRUC BLOCKS. */
  435. if (findex_1.mdir % 180 == 0) {
  436. return ret_val;
  437. }
  438. /* !IF MIRROR N-S, DONE. */
  439. L8300:
  440. ldir = findex_1.mdir;
  441. /* !SEE WHICH MIRROR. */
  442. if (prsvec_1.prso == xsrch_1.xsouth) {
  443. ldir = 180;
  444. }
  445. curxt_1.xstrng = 815;
  446. /* !MIRROR BLOCKS. */
  447. if (ldir > 180 && ! findex_1.mr1f || ldir < 180 && ! findex_1.mr2f) {
  448. curxt_1.xstrng = 816;
  449. }
  450. return ret_val;
  451. /* C9- FROBOZZ FLAG (MIRIN) */
  452. L9000:
  453. if (mrhere_(play_1.here) != 1) {
  454. goto L9100;
  455. }
  456. /* !MIRROR 1 HERE? */
  457. if (findex_1.mr1f) {
  458. curxt_1.xstrng = 805;
  459. }
  460. /* !SEE IF BROKEN. */
  461. findex_1.frobzf = findex_1.mropnf;
  462. /* !ENTER IF OPEN. */
  463. return ret_val;
  464. L9100:
  465. findex_1.frobzf = FALSE_;
  466. /* !NOT HERE, */
  467. curxt_1.xstrng = 817;
  468. /* !LOSE. */
  469. return ret_val;
  470. /* CXAPPL, PAGE 4 */
  471. /* C10- FROBOZZ FLAG (MIRROR EXIT) */
  472. L10000:
  473. findex_1.frobzf = FALSE_;
  474. /* !ASSUME CANT. */
  475. ldir = (prsvec_1.prso - xsrch_1.xnorth) / xsrch_1.xnorth * 45;
  476. /* !XLATE DIR TO DEGREES. */
  477. if (! findex_1.mropnf || (findex_1.mdir + 270) % 360 != ldir &&
  478. prsvec_1.prso != xsrch_1.xexit) {
  479. goto L10200;
  480. }
  481. curxt_1.xroom1 = (findex_1.mloc - rindex_1.mra << 1) + rindex_1.mrae + 1
  482. - findex_1.mdir / 180;
  483. /* !ASSUME E-W EXIT. */
  484. if (findex_1.mdir % 180 == 0) {
  485. goto L10100;
  486. }
  487. /* !IF N-S, OK. */
  488. curxt_1.xroom1 = findex_1.mloc + 1;
  489. /* !ASSUME N EXIT. */
  490. if (findex_1.mdir > 180) {
  491. curxt_1.xroom1 = findex_1.mloc - 1;
  492. }
  493. /* !IF SOUTH. */
  494. L10100:
  495. ret_val = curxt_1.xroom1;
  496. return ret_val;
  497. L10200:
  498. if (! findex_1.wdopnf || (findex_1.mdir + 180) % 360 != ldir &&
  499. prsvec_1.prso != xsrch_1.xexit) {
  500. return ret_val;
  501. }
  502. curxt_1.xroom1 = findex_1.mloc + 1;
  503. /* !ASSUME N. */
  504. if (findex_1.mdir == 0) {
  505. curxt_1.xroom1 = findex_1.mloc - 1;
  506. }
  507. /* !IF S. */
  508. rspeak_(818);
  509. /* !CLOSE DOOR. */
  510. findex_1.wdopnf = FALSE_;
  511. ret_val = curxt_1.xroom1;
  512. return ret_val;
  513. /* C11- MAYBE DOOR. NORMAL MESSAGE IS THAT DOOR IS CLOSED. */
  514. /* BUT IF LCELL.NE.4, DOOR ISNT THERE. */
  515. L11000:
  516. if (findex_1.lcell != 4) {
  517. curxt_1.xstrng = 678;
  518. }
  519. /* !SET UP MSG. */
  520. return ret_val;
  521. /* C12- FROBZF (PUZZLE ROOM MAIN ENTRANCE) */
  522. L12000:
  523. findex_1.frobzf = TRUE_;
  524. /* !ALWAYS ENTER. */
  525. findex_1.cphere = 10;
  526. /* !SET SUBSTATE. */
  527. return ret_val;
  528. /* C13- CPOUTF (PUZZLE ROOM SIZE ENTRANCE) */
  529. L13000:
  530. findex_1.cphere = 52;
  531. /* !SET SUBSTATE. */
  532. return ret_val;
  533. /* CXAPPL, PAGE 5 */
  534. /* C14- FROBZF (PUZZLE ROOM TRANSITIONS) */
  535. L14000:
  536. findex_1.frobzf = FALSE_;
  537. /* !ASSSUME LOSE. */
  538. if (prsvec_1.prso != xsrch_1.xup) {
  539. goto L14100;
  540. }
  541. /* !UP? */
  542. if (findex_1.cphere != 10) {
  543. return ret_val;
  544. }
  545. /* !AT EXIT? */
  546. curxt_1.xstrng = 881;
  547. /* !ASSUME NO LADDER. */
  548. if (puzzle_1.cpvec[findex_1.cphere] != -2) {
  549. return ret_val;
  550. }
  551. /* !LADDER HERE? */
  552. rspeak_(882);
  553. /* !YOU WIN. */
  554. findex_1.frobzf = TRUE_;
  555. /* !LET HIM OUT. */
  556. return ret_val;
  557. L14100:
  558. if (findex_1.cphere != 52 || prsvec_1.prso != xsrch_1.xwest || !
  559. findex_1.cpoutf) {
  560. goto L14200;
  561. }
  562. findex_1.frobzf = TRUE_;
  563. /* !YES, LET HIM OUT. */
  564. return ret_val;
  565. L14200:
  566. for (i = 1; i <= 16; i += 2) {
  567. /* !LOCATE EXIT. */
  568. if (prsvec_1.prso == puzzle_1.cpdr[i - 1]) {
  569. goto L14400;
  570. }
  571. /* L14300: */
  572. }
  573. return ret_val;
  574. /* !NO SUCH EXIT. */
  575. L14400:
  576. j = puzzle_1.cpdr[i];
  577. /* !GET DIRECTIONAL OFFSET. */
  578. nxt = findex_1.cphere + j;
  579. /* !GET NEXT STATE. */
  580. k = 8;
  581. /* !GET ORTHOGONAL DIR. */
  582. if (j < 0) {
  583. k = -8;
  584. }
  585. if ((abs(j) == 1 || abs(j) == 8 || (puzzle_1.cpvec[findex_1.cphere + k -
  586. 1] == 0 || puzzle_1.cpvec[nxt - k - 1] == 0)) && puzzle_1.cpvec[
  587. nxt - 1] == 0) {
  588. goto L14500;
  589. }
  590. return ret_val;
  591. L14500:
  592. cpgoto_(nxt);
  593. /* !MOVE TO STATE. */
  594. curxt_1.xroom1 = rindex_1.cpuzz;
  595. /* !STAY IN ROOM. */
  596. ret_val = curxt_1.xroom1;
  597. return ret_val;
  598. } /* cxappl_ */