1 /*- 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * The game adventure was originally written in Fortran by Will Crowther 6 * and Don Woods. It was later translated to C and enhanced by Jim 7 * Gillogly. This code is derived from software contributed to Berkeley 8 * by Jim Gillogly at The Rand Corporation. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)done.c 8.1 (Berkeley) 5/31/93 39 * $FreeBSD: src/games/adventure/done.c,v 1.7 1999/12/19 00:21:50 billf Exp $ 40 * $DragonFly: src/games/adventure/done.c,v 1.3 2005/03/25 12:56:48 liamfoy Exp $ 41 */ 42 43 /* Re-coding of advent in C: termination routines */ 44 45 #include <stdio.h> 46 #include <stdlib.h> 47 #include "hdr.h" 48 49 int 50 score() /* sort of like 20000 */ 51 { int scor,i; 52 mxscor=scor=0; 53 for (i=50; i<=maxtrs; i++) 54 { if (ptext[i].txtlen==0) continue; 55 k=12; 56 if (i==chest) k=14; 57 if (i>chest) k=16; 58 if (prop[i]>=0) scor += 2; 59 if (place[i]==3&&prop[i]==0) scor += k-2; 60 mxscor += k; 61 } 62 scor += (maxdie-numdie)*10; 63 mxscor += maxdie*10; 64 if (!(scorng||gaveup)) scor += 4; 65 mxscor += 4; 66 if (dflag!=0) scor += 25; 67 mxscor += 25; 68 if (closng) scor += 25; 69 mxscor += 25; 70 if (closed) 71 { if (bonus==0) scor += 10; 72 if (bonus==135) scor += 25; 73 if (bonus==134) scor += 30; 74 if (bonus==133) scor += 45; 75 } 76 mxscor += 45; 77 if (place[magzin]==108) scor++; 78 mxscor++; 79 scor += 2; 80 mxscor += 2; 81 for (i=1; i<=hntmax; i++) 82 if (hinted[i]) scor -= hints[i][2]; 83 return(scor); 84 } 85 86 void 87 done(entry) /* entry=1 means goto 13000 */ /* game is over */ 88 int entry; /* entry=2 means goto 20000 */ /* 3=19000 */ 89 { int i,sc; 90 if (entry==1) mspeak(1); 91 if (entry==3) rspeak(136); 92 printf("\n\n\nYou scored %d out of a ",(sc=score())); 93 printf("possible %d using %d turns.\n",mxscor,turns); 94 for (i=1; i<=clsses; i++) 95 if (cval[i]>=sc) 96 { speak(&ctext[i]); 97 if (i==clsses-1) 98 { printf("To achieve the next higher rating"); 99 printf(" would be a neat trick!\n\n"); 100 printf("Congratulations!!\n"); 101 exit(0); 102 } 103 k=cval[i]+1-sc; 104 printf("To achieve the next higher rating, you need"); 105 printf(" %d more point",k); 106 if (k==1) printf(".\n"); 107 else printf("s.\n"); 108 exit(0); 109 } 110 printf("You just went off my scale!!!\n"); 111 exit(0); 112 } 113 114 115 void 116 die(entry) /* label 90 */ 117 int entry; 118 { int i; 119 if (entry != 99) 120 { rspeak(23); 121 oldlc2=loc; 122 } 123 if (closng) /* 99 */ 124 { rspeak(131); 125 numdie++; 126 done(2); 127 } 128 yea=yes(81+numdie*2,82+numdie*2,54); 129 numdie++; 130 if (numdie==maxdie || !yea) done(2); 131 place[water]=0; 132 place[oil]=0; 133 if (toting(lamp)) prop[lamp]=0; 134 for (i=100; i>=1; i--) 135 { if (!toting(i)) continue; 136 k=oldlc2; 137 if (i==lamp) k=1; 138 drop(i,k); 139 } 140 loc=3; 141 oldloc=loc; 142 } 143