trek/help.c

   1 /*      $NetBSD: help.c,v 1.3 1995/04/22 10:59:01 cgd 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. All advertising materials mentioning features or use of this software
  16  *    must display the following acknowledgement:
  17  *      This product includes software developed by the University of
  18  *      California, Berkeley and its contributors.
  19  * 4. Neither the name of the University nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35
  36 #ifndef lint
  37 #if 0
  38 static char sccsid[] = "@(#)help.c      8.1 (Berkeley) 5/31/93";
  39 #else
  40 static char rcsid[] = "$NetBSD: help.c,v 1.3 1995/04/22 10:59:01 cgd Exp $";
  41 #endif
  42 #endif /* not lint */
  43
  44 # include       "trek.h"
  45
  46 /*
  47 **  call starbase for help
  48 **
  49 **      First, the closest starbase is selected.  If there is a
  50 **      a starbase in your own quadrant, you are in good shape.
  51 **      This distance takes quadrant distances into account only.
  52 **
  53 **      A magic number is computed based on the distance which acts
  54 **      as the probability that you will be rematerialized.  You
  55 **      get three tries.
  56 **
  57 **      When it is determined that you should be able to be remater-
  58 **      ialized (i.e., when the probability thing mentioned above
  59 **      comes up positive), you are put into that quadrant (anywhere).
  60 **      Then, we try to see if there is a spot adjacent to the star-
  61 **      base.  If not, you can't be rematerialized!!!  Otherwise,
  62 **      it drops you there.  It only tries five times to find a spot
  63 **      to drop you.  After that, it's your problem.
  64 */
  65
  66 char    *Cntvect[3] =
  67 {"first", "second", "third"};
  68
  69 help()
  70 {
  71         register int            i;
  72         double                  dist, x;
  73         register int            dx, dy;
  74         int                     j, l;
  75
  76         /* check to see if calling for help is reasonable ... */
  77         if (Ship.cond == DOCKED)
  78                 return (printf("Uhura: But Captain, we're already docked\n"));
  79
  80         /* or possible */
  81         if (damaged(SSRADIO))
  82                 return (out(SSRADIO));
  83         if (Now.bases <= 0)
  84                 return (printf("Uhura: I'm not getting any response from starbase\n"));
  85
  86         /* tut tut, there goes the score */
  87         Game.helps += 1;
  88
  89         /* find the closest base */
  90         dist = 1e50;
  91         if (Quad[Ship.quadx][Ship.quady].bases <= 0)
  92         {
  93                 /* there isn't one in this quadrant */
  94                 for (i = 0; i < Now.bases; i++)
  95                 {
  96                         /* compute distance */
  97                         dx = Now.base[i].x - Ship.quadx;
  98                         dy = Now.base[i].y - Ship.quady;
  99                         x = dx * dx + dy * dy;
 100                         x = sqrt(x);
 101
 102                         /* see if better than what we already have */
 103                         if (x < dist)
 104                         {
 105                                 dist = x;
 106                                 l = i;
 107                         }
 108                 }
 109
 110                 /* go to that quadrant */
 111                 Ship.quadx = Now.base[l].x;
 112                 Ship.quady = Now.base[l].y;
 113                 initquad(1);
 114         }
 115         else
 116         {
 117                 dist = 0.0;
 118         }
 119
 120         /* dematerialize the Enterprise */
 121         Sect[Ship.sectx][Ship.secty] = EMPTY;
 122         printf("Starbase in %d,%d responds\n", Ship.quadx, Ship.quady);
 123
 124         /* this next thing acts as a probability that it will work */
 125         x = pow(1.0 - pow(0.94, dist), 0.3333333);
 126
 127         /* attempt to rematerialize */
 128         for (i = 0; i < 3; i++)
 129         {
 130                 sleep(2);
 131                 printf("%s attempt to rematerialize ", Cntvect[i]);
 132                 if (franf() > x)
 133                 {
 134                         /* ok, that's good.  let's see if we can set her down */
 135                         for (j = 0; j < 5; j++)
 136                         {
 137                                 dx = Etc.starbase.x + ranf(3) - 1;
 138                                 if (dx < 0 || dx >= NSECTS)
 139                                         continue;
 140                                 dy = Etc.starbase.y + ranf(3) - 1;
 141                                 if (dy < 0 || dy >= NSECTS || Sect[dx][dy] != EMPTY)
 142                                         continue;
 143                                 break;
 144                         }
 145                         if (j < 5)
 146                         {
 147                                 /* found an empty spot */
 148                                 printf("succeeds\n");
 149                                 Ship.sectx = dx;
 150                                 Ship.secty = dy;
 151                                 Sect[dx][dy] = Ship.ship;
 152                                 dock();
 153                                 compkldist(0);
 154                                 return;
 155                         }
 156                         /* the starbase must have been surrounded */
 157                 }
 158                 printf("fails\n");
 159         }
 160
 161         /* one, two, three strikes, you're out */
 162         lose(L_NOHELP);
 163 }