trek/computer.c

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