Home | History | Annotate | Line # | Download | only in trek
help.c revision 1.4
      1 /*	$NetBSD: help.c,v 1.4 1997/10/12 21:24:53 christos 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 #include <sys/cdefs.h>
     37 #ifndef lint
     38 #if 0
     39 static char sccsid[] = "@(#)help.c	8.1 (Berkeley) 5/31/93";
     40 #else
     41 __RCSID("$NetBSD: help.c,v 1.4 1997/10/12 21:24:53 christos Exp $");
     42 #endif
     43 #endif /* not lint */
     44 
     45 #include <stdio.h>
     46 #include <math.h>
     47 #include <unistd.h>
     48 #include "trek.h"
     49 
     50 /*
     51 **  call starbase for help
     52 **
     53 **	First, the closest starbase is selected.  If there is a
     54 **	a starbase in your own quadrant, you are in good shape.
     55 **	This distance takes quadrant distances into account only.
     56 **
     57 **	A magic number is computed based on the distance which acts
     58 **	as the probability that you will be rematerialized.  You
     59 **	get three tries.
     60 **
     61 **	When it is determined that you should be able to be remater-
     62 **	ialized (i.e., when the probability thing mentioned above
     63 **	comes up positive), you are put into that quadrant (anywhere).
     64 **	Then, we try to see if there is a spot adjacent to the star-
     65 **	base.  If not, you can't be rematerialized!!!  Otherwise,
     66 **	it drops you there.  It only tries five times to find a spot
     67 **	to drop you.  After that, it's your problem.
     68 */
     69 
     70 char	*Cntvect[3] =
     71 {"first", "second", "third"};
     72 
     73 /*ARGSUSED*/
     74 void
     75 help(v)
     76 	int v;
     77 {
     78 	int		i;
     79 	double		dist, x;
     80 	int		dx = 0, dy = 0;
     81 	int		j, l = 0;
     82 
     83 	/* check to see if calling for help is reasonable ... */
     84 	if (Ship.cond == DOCKED) {
     85 		printf("Uhura: But Captain, we're already docked\n");
     86 		return;
     87 	}
     88 
     89 	/* or possible */
     90 	if (damaged(SSRADIO)) {
     91 		out(SSRADIO);
     92 		return;
     93 	}
     94 	if (Now.bases <= 0) {
     95 		printf("Uhura: I'm not getting any response from starbase\n");
     96 		return;
     97 	}
     98 
     99 	/* tut tut, there goes the score */
    100 	Game.helps += 1;
    101 
    102 	/* find the closest base */
    103 	dist = 1e50;
    104 	if (Quad[Ship.quadx][Ship.quady].bases <= 0)
    105 	{
    106 		/* there isn't one in this quadrant */
    107 		for (i = 0; i < Now.bases; i++)
    108 		{
    109 			/* compute distance */
    110 			dx = Now.base[i].x - Ship.quadx;
    111 			dy = Now.base[i].y - Ship.quady;
    112 			x = dx * dx + dy * dy;
    113 			x = sqrt(x);
    114 
    115 			/* see if better than what we already have */
    116 			if (x < dist)
    117 			{
    118 				dist = x;
    119 				l = i;
    120 			}
    121 		}
    122 
    123 		/* go to that quadrant */
    124 		Ship.quadx = Now.base[l].x;
    125 		Ship.quady = Now.base[l].y;
    126 		initquad(1);
    127 	}
    128 	else
    129 	{
    130 		dist = 0.0;
    131 	}
    132 
    133 	/* dematerialize the Enterprise */
    134 	Sect[Ship.sectx][Ship.secty] = EMPTY;
    135 	printf("Starbase in %d,%d responds\n", Ship.quadx, Ship.quady);
    136 
    137 	/* this next thing acts as a probability that it will work */
    138 	x = pow(1.0 - pow(0.94, dist), 0.3333333);
    139 
    140 	/* attempt to rematerialize */
    141 	for (i = 0; i < 3; i++)
    142 	{
    143 		sleep(2);
    144 		printf("%s attempt to rematerialize ", Cntvect[i]);
    145 		if (franf() > x)
    146 		{
    147 			/* ok, that's good.  let's see if we can set her down */
    148 			for (j = 0; j < 5; j++)
    149 			{
    150 				dx = Etc.starbase.x + ranf(3) - 1;
    151 				if (dx < 0 || dx >= NSECTS)
    152 					continue;
    153 				dy = Etc.starbase.y + ranf(3) - 1;
    154 				if (dy < 0 || dy >= NSECTS || Sect[dx][dy] != EMPTY)
    155 					continue;
    156 				break;
    157 			}
    158 			if (j < 5)
    159 			{
    160 				/* found an empty spot */
    161 				printf("succeeds\n");
    162 				Ship.sectx = dx;
    163 				Ship.secty = dy;
    164 				Sect[dx][dy] = Ship.ship;
    165 				dock(0);
    166 				compkldist(0);
    167 				return;
    168 			}
    169 			/* the starbase must have been surrounded */
    170 		}
    171 		printf("fails\n");
    172 	}
    173 
    174 	/* one, two, three strikes, you're out */
    175 	lose(L_NOHELP);
    176 }
    177