games/trek/help.c

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