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