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