computer.c revision 1.4 1 1.4 cgd /* $NetBSD: computer.c,v 1.4 1995/04/24 12:25:51 cgd Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #ifndef lint
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)computer.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.4 cgd static char rcsid[] = "$NetBSD: computer.c,v 1.4 1995/04/24 12:25:51 cgd Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd # include "trek.h"
45 1.1 cgd # include "getpar.h"
46 1.1 cgd # include <stdio.h>
47 1.1 cgd /*
48 1.1 cgd ** On-Board Computer
49 1.1 cgd **
50 1.1 cgd ** A computer request is fetched from the captain. The requests
51 1.1 cgd ** are:
52 1.1 cgd **
53 1.1 cgd ** chart -- print a star chart of the known galaxy. This includes
54 1.1 cgd ** every quadrant that has ever had a long range or
55 1.1 cgd ** a short range scan done of it, plus the location of
56 1.1 cgd ** all starbases. This is of course updated by any sub-
57 1.1 cgd ** space radio broadcasts (unless the radio is out).
58 1.1 cgd ** The format is the same as that of a long range scan
59 1.1 cgd ** except that ".1." indicates that a starbase exists
60 1.1 cgd ** but we know nothing else.
61 1.1 cgd **
62 1.1 cgd ** trajectory -- gives the course and distance to every know
63 1.1 cgd ** Klingon in the quadrant. Obviously this fails if the
64 1.1 cgd ** short range scanners are out.
65 1.1 cgd **
66 1.1 cgd ** course -- gives a course computation from whereever you are
67 1.1 cgd ** to any specified location. If the course begins
68 1.1 cgd ** with a slash, the current quadrant is taken.
69 1.1 cgd ** Otherwise the input is quadrant and sector coordi-
70 1.1 cgd ** nates of the target sector.
71 1.1 cgd **
72 1.1 cgd ** move -- identical to course, except that the move is performed.
73 1.1 cgd **
74 1.1 cgd ** score -- prints out the current score.
75 1.1 cgd **
76 1.1 cgd ** pheff -- "PHaser EFFectiveness" at a given distance. Tells
77 1.1 cgd ** you how much stuff you need to make it work.
78 1.1 cgd **
79 1.1 cgd ** warpcost -- Gives you the cost in time and units to move for
80 1.1 cgd ** a given distance under a given warp speed.
81 1.1 cgd **
82 1.1 cgd ** impcost -- Same for the impulse engines.
83 1.1 cgd **
84 1.1 cgd ** distresslist -- Gives a list of the currently known starsystems
85 1.1 cgd ** or starbases which are distressed, together with their
86 1.1 cgd ** quadrant coordinates.
87 1.1 cgd **
88 1.1 cgd ** If a command is terminated with a semicolon, you remain in
89 1.1 cgd ** the computer; otherwise, you escape immediately to the main
90 1.1 cgd ** command processor.
91 1.1 cgd */
92 1.1 cgd
93 1.1 cgd struct cvntab Cputab[] =
94 1.1 cgd {
95 1.1 cgd "ch", "art", (int (*)())1, 0,
96 1.1 cgd "t", "rajectory", (int (*)())2, 0,
97 1.1 cgd "c", "ourse", (int (*)())3, 0,
98 1.1 cgd "m", "ove", (int (*)())3, 1,
99 1.1 cgd "s", "core", (int (*)())4, 0,
100 1.1 cgd "p", "heff", (int (*)())5, 0,
101 1.1 cgd "w", "arpcost", (int (*)())6, 0,
102 1.1 cgd "i", "mpcost", (int (*)())7, 0,
103 1.1 cgd "d", "istresslist", (int (*)())8, 0,
104 1.1 cgd 0
105 1.1 cgd };
106 1.1 cgd
107 1.1 cgd computer()
108 1.1 cgd {
109 1.1 cgd int ix, iy;
110 1.1 cgd register int i, j;
111 1.1 cgd int numout;
112 1.1 cgd int tqx, tqy;
113 1.1 cgd struct cvntab *r;
114 1.1 cgd int cost;
115 1.1 cgd int course;
116 1.1 cgd double dist, time;
117 1.1 cgd double warpfact;
118 1.1 cgd struct quad *q;
119 1.1 cgd register struct event *e;
120 1.1 cgd
121 1.1 cgd if (check_out(COMPUTER))
122 1.1 cgd return;
123 1.1 cgd while (1)
124 1.1 cgd {
125 1.1 cgd r = getcodpar("\nRequest", Cputab);
126 1.4 cgd switch ((long)r->value)
127 1.1 cgd {
128 1.1 cgd
129 1.1 cgd case 1: /* star chart */
130 1.1 cgd printf("Computer record of galaxy for all long range sensor scans\n\n");
131 1.1 cgd printf(" ");
132 1.1 cgd /* print top header */
133 1.1 cgd for (i = 0; i < NQUADS; i++)
134 1.1 cgd printf("-%d- ", i);
135 1.1 cgd printf("\n");
136 1.1 cgd for (i = 0; i < NQUADS; i++)
137 1.1 cgd {
138 1.1 cgd printf("%d ", i);
139 1.1 cgd for (j = 0; j < NQUADS; j++)
140 1.1 cgd {
141 1.1 cgd if (i == Ship.quadx && j == Ship.quady)
142 1.1 cgd {
143 1.1 cgd printf("$$$ ");
144 1.1 cgd continue;
145 1.1 cgd }
146 1.1 cgd q = &Quad[i][j];
147 1.1 cgd /* 1000 or 1001 is special case */
148 1.1 cgd if (q->scanned >= 1000)
149 1.1 cgd if (q->scanned > 1000)
150 1.1 cgd printf(".1. ");
151 1.1 cgd else
152 1.1 cgd printf("/// ");
153 1.1 cgd else
154 1.1 cgd if (q->scanned < 0)
155 1.1 cgd printf("... ");
156 1.1 cgd else
157 1.1 cgd printf("%3d ", q->scanned);
158 1.1 cgd }
159 1.1 cgd printf("%d\n", i);
160 1.1 cgd }
161 1.1 cgd printf(" ");
162 1.1 cgd /* print bottom footer */
163 1.1 cgd for (i = 0; i < NQUADS; i++)
164 1.1 cgd printf("-%d- ", i);
165 1.1 cgd printf("\n");
166 1.1 cgd break;
167 1.1 cgd
168 1.1 cgd case 2: /* trajectory */
169 1.1 cgd if (check_out(SRSCAN))
170 1.1 cgd {
171 1.1 cgd break;
172 1.1 cgd }
173 1.1 cgd if (Etc.nkling <= 0)
174 1.1 cgd {
175 1.1 cgd printf("No Klingons in this quadrant\n");
176 1.1 cgd break;
177 1.1 cgd }
178 1.1 cgd /* for each Klingon, give the course & distance */
179 1.1 cgd for (i = 0; i < Etc.nkling; i++)
180 1.1 cgd {
181 1.1 cgd printf("Klingon at %d,%d", Etc.klingon[i].x, Etc.klingon[i].y);
182 1.1 cgd course = kalc(Ship.quadx, Ship.quady, Etc.klingon[i].x, Etc.klingon[i].y, &dist);
183 1.1 cgd prkalc(course, dist);
184 1.1 cgd }
185 1.1 cgd break;
186 1.1 cgd
187 1.1 cgd case 3: /* course calculation */
188 1.1 cgd if (readdelim('/'))
189 1.1 cgd {
190 1.1 cgd tqx = Ship.quadx;
191 1.1 cgd tqy = Ship.quady;
192 1.1 cgd }
193 1.1 cgd else
194 1.1 cgd {
195 1.1 cgd ix = getintpar("Quadrant");
196 1.1 cgd if (ix < 0 || ix >= NSECTS)
197 1.1 cgd break;
198 1.1 cgd iy = getintpar("q-y");
199 1.1 cgd if (iy < 0 || iy >= NSECTS)
200 1.1 cgd break;
201 1.1 cgd tqx = ix;
202 1.1 cgd tqy = iy;
203 1.1 cgd }
204 1.1 cgd ix = getintpar("Sector");
205 1.1 cgd if (ix < 0 || ix >= NSECTS)
206 1.1 cgd break;
207 1.1 cgd iy = getintpar("s-y");
208 1.1 cgd if (iy < 0 || iy >= NSECTS)
209 1.1 cgd break;
210 1.1 cgd course = kalc(tqx, tqy, ix, iy, &dist);
211 1.1 cgd if (r->value2)
212 1.1 cgd {
213 1.1 cgd warp(-1, course, dist);
214 1.1 cgd break;
215 1.1 cgd }
216 1.1 cgd printf("%d,%d/%d,%d to %d,%d/%d,%d",
217 1.1 cgd Ship.quadx, Ship.quady, Ship.sectx, Ship.secty, tqx, tqy, ix, iy);
218 1.1 cgd prkalc(course, dist);
219 1.1 cgd break;
220 1.1 cgd
221 1.1 cgd case 4: /* score */
222 1.1 cgd score();
223 1.1 cgd break;
224 1.1 cgd
225 1.1 cgd case 5: /* phaser effectiveness */
226 1.1 cgd dist = getfltpar("range");
227 1.1 cgd if (dist < 0.0)
228 1.1 cgd break;
229 1.1 cgd dist *= 10.0;
230 1.1 cgd cost = pow(0.90, dist) * 98.0 + 0.5;
231 1.1 cgd printf("Phasers are %d%% effective at that range\n", cost);
232 1.1 cgd break;
233 1.1 cgd
234 1.1 cgd case 6: /* warp cost (time/energy) */
235 1.1 cgd dist = getfltpar("distance");
236 1.1 cgd if (dist < 0.0)
237 1.1 cgd break;
238 1.1 cgd warpfact = getfltpar("warp factor");
239 1.1 cgd if (warpfact <= 0.0)
240 1.1 cgd warpfact = Ship.warp;
241 1.1 cgd cost = (dist + 0.05) * warpfact * warpfact * warpfact;
242 1.1 cgd time = Param.warptime * dist / (warpfact * warpfact);
243 1.1 cgd printf("Warp %.2f distance %.2f cost %.2f stardates %d (%d w/ shlds up) units\n",
244 1.1 cgd warpfact, dist, time, cost, cost + cost);
245 1.1 cgd break;
246 1.1 cgd
247 1.1 cgd case 7: /* impulse cost */
248 1.1 cgd dist = getfltpar("distance");
249 1.1 cgd if (dist < 0.0)
250 1.1 cgd break;
251 1.1 cgd cost = 20 + 100 * dist;
252 1.1 cgd time = dist / 0.095;
253 1.1 cgd printf("Distance %.2f cost %.2f stardates %d units\n",
254 1.1 cgd dist, time, cost);
255 1.1 cgd break;
256 1.1 cgd
257 1.1 cgd case 8: /* distresslist */
258 1.1 cgd j = 1;
259 1.1 cgd printf("\n");
260 1.1 cgd /* scan the event list */
261 1.1 cgd for (i = 0; i < MAXEVENTS; i++)
262 1.1 cgd {
263 1.1 cgd e = &Event[i];
264 1.1 cgd /* ignore hidden entries */
265 1.1 cgd if (e->evcode & E_HIDDEN)
266 1.1 cgd continue;
267 1.1 cgd switch (e->evcode & E_EVENT)
268 1.1 cgd {
269 1.1 cgd
270 1.1 cgd case E_KDESB:
271 1.1 cgd printf("Klingon is attacking starbase in quadrant %d,%d\n",
272 1.1 cgd e->x, e->y);
273 1.1 cgd j = 0;
274 1.1 cgd break;
275 1.1 cgd
276 1.1 cgd case E_ENSLV:
277 1.1 cgd case E_REPRO:
278 1.1 cgd printf("Starsystem %s in quadrant %d,%d is distressed\n",
279 1.1 cgd Systemname[e->systemname], e->x, e->y);
280 1.1 cgd j = 0;
281 1.1 cgd break;
282 1.1 cgd }
283 1.1 cgd }
284 1.1 cgd if (j)
285 1.1 cgd printf("No known distress calls are active\n");
286 1.1 cgd break;
287 1.1 cgd
288 1.1 cgd }
289 1.1 cgd
290 1.1 cgd /* skip to next semicolon or newline. Semicolon
291 1.1 cgd * means get new computer request; newline means
292 1.1 cgd * exit computer mode. */
293 1.1 cgd while ((i = cgetc(0)) != ';')
294 1.1 cgd {
295 1.1 cgd if (i == '\0')
296 1.1 cgd exit(1);
297 1.1 cgd if (i == '\n')
298 1.1 cgd {
299 1.1 cgd ungetc(i, stdin);
300 1.1 cgd return;
301 1.1 cgd }
302 1.1 cgd }
303 1.1 cgd }
304 1.1 cgd }
305 1.1 cgd
306 1.1 cgd
307 1.1 cgd /*
308 1.1 cgd ** Course Calculation
309 1.1 cgd **
310 1.1 cgd ** Computes and outputs the course and distance from position
311 1.1 cgd ** sqx,sqy/ssx,ssy to tqx,tqy/tsx,tsy.
312 1.1 cgd */
313 1.1 cgd
314 1.1 cgd kalc(tqx, tqy, tsx, tsy, dist)
315 1.1 cgd int tqx;
316 1.1 cgd int tqy;
317 1.1 cgd int tsx;
318 1.1 cgd int tsy;
319 1.1 cgd double *dist;
320 1.1 cgd {
321 1.1 cgd double dx, dy;
322 1.1 cgd double quadsize;
323 1.1 cgd double angle;
324 1.1 cgd register int course;
325 1.1 cgd
326 1.1 cgd /* normalize to quadrant distances */
327 1.1 cgd quadsize = NSECTS;
328 1.1 cgd dx = (Ship.quadx + Ship.sectx / quadsize) - (tqx + tsx / quadsize);
329 1.1 cgd dy = (tqy + tsy / quadsize) - (Ship.quady + Ship.secty / quadsize);
330 1.1 cgd
331 1.1 cgd /* get the angle */
332 1.1 cgd angle = atan2(dy, dx);
333 1.1 cgd /* make it 0 -> 2 pi */
334 1.1 cgd if (angle < 0.0)
335 1.1 cgd angle += 6.283185307;
336 1.1 cgd /* convert from radians to degrees */
337 1.1 cgd course = angle * 57.29577951 + 0.5;
338 1.1 cgd dx = dx * dx + dy * dy;
339 1.1 cgd *dist = sqrt(dx);
340 1.1 cgd return (course);
341 1.1 cgd }
342 1.1 cgd
343 1.1 cgd
344 1.1 cgd prkalc(course, dist)
345 1.1 cgd int course;
346 1.1 cgd double dist;
347 1.1 cgd {
348 1.1 cgd printf(": course %d dist %.3f\n", course, dist);
349 1.1 cgd }
350