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