trek/help.c

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