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.4 2007/04/18 18:32:12 swildner 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 /* sort of like 20000 */ 50 int 51 score(void) 52 { int scor,i; 53 mxscor=scor=0; 54 for (i=50; i<=maxtrs; i++) 55 { if (ptext[i].txtlen==0) continue; 56 k=12; 57 if (i==chest) k=14; 58 if (i>chest) k=16; 59 if (prop[i]>=0) scor += 2; 60 if (place[i]==3&&prop[i]==0) scor += k-2; 61 mxscor += k; 62 } 63 scor += (maxdie-numdie)*10; 64 mxscor += maxdie*10; 65 if (!(scorng||gaveup)) scor += 4; 66 mxscor += 4; 67 if (dflag!=0) scor += 25; 68 mxscor += 25; 69 if (closng) scor += 25; 70 mxscor += 25; 71 if (closed) 72 { if (bonus==0) scor += 10; 73 if (bonus==135) scor += 25; 74 if (bonus==134) scor += 30; 75 if (bonus==133) scor += 45; 76 } 77 mxscor += 45; 78 if (place[magzin]==108) scor++; 79 mxscor++; 80 scor += 2; 81 mxscor += 2; 82 for (i=1; i<=hntmax; i++) 83 if (hinted[i]) scor -= hints[i][2]; 84 return(scor); 85 } 86 87 /* entry=1 means goto 13000 */ /* game is over */ 88 /* entry=2 means goto 20000 */ /* 3=19000 */ 89 void 90 done(int entry) 91 { int i,sc; 92 if (entry==1) mspeak(1); 93 if (entry==3) rspeak(136); 94 printf("\n\n\nYou scored %d out of a ",(sc=score())); 95 printf("possible %d using %d turns.\n",mxscor,turns); 96 for (i=1; i<=clsses; i++) 97 if (cval[i]>=sc) 98 { speak(&ctext[i]); 99 if (i==clsses-1) 100 { printf("To achieve the next higher rating"); 101 printf(" would be a neat trick!\n\n"); 102 printf("Congratulations!!\n"); 103 exit(0); 104 } 105 k=cval[i]+1-sc; 106 printf("To achieve the next higher rating, you need"); 107 printf(" %d more point",k); 108 if (k==1) printf(".\n"); 109 else printf("s.\n"); 110 exit(0); 111 } 112 printf("You just went off my scale!!!\n"); 113 exit(0); 114 } 115 116 117 /* label 90 */ 118 void 119 die(int entry) 120 { int i; 121 if (entry != 99) 122 { rspeak(23); 123 oldlc2=loc; 124 } 125 if (closng) /* 99 */ 126 { rspeak(131); 127 numdie++; 128 done(2); 129 } 130 yea=yes(81+numdie*2,82+numdie*2,54); 131 numdie++; 132 if (numdie==maxdie || !yea) done(2); 133 place[water]=0; 134 place[oil]=0; 135 if (toting(lamp)) prop[lamp]=0; 136 for (i=100; i>=1; i--) 137 { if (!toting(i)) continue; 138 k=oldlc2; 139 if (i==lamp) k=1; 140 drop(i,k); 141 } 142 loc=3; 143 oldloc=loc; 144 } 145