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