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