nova.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1980 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd static char sccsid[] = "@(#)nova.c 5.4 (Berkeley) 6/1/90";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd # include "trek.h"
39 1.1 cgd
40 1.1 cgd /*
41 1.1 cgd ** CAUSE A NOVA TO OCCUR
42 1.1 cgd **
43 1.1 cgd ** A nova occurs. It is the result of having a star hit with
44 1.1 cgd ** a photon torpedo. There are several things which may happen.
45 1.1 cgd ** The star may not be affected. It may go nova. It may turn
46 1.1 cgd ** into a black hole. Any (yummy) it may go supernova.
47 1.1 cgd **
48 1.1 cgd ** Stars that go nova cause stars which surround them to undergo
49 1.1 cgd ** the same probabilistic process. Klingons next to them are
50 1.1 cgd ** destroyed. And if the starship is next to it, it gets zapped.
51 1.1 cgd ** If the zap is too much, it gets destroyed.
52 1.1 cgd */
53 1.1 cgd
54 1.1 cgd nova(x, y)
55 1.1 cgd int x, y;
56 1.1 cgd {
57 1.1 cgd register int i, j;
58 1.1 cgd register int se;
59 1.1 cgd
60 1.1 cgd if (Sect[x][y] != STAR || Quad[Ship.quadx][Ship.quady].stars < 0)
61 1.1 cgd return;
62 1.1 cgd if (ranf(100) < 15)
63 1.1 cgd {
64 1.1 cgd printf("Spock: Star at %d,%d failed to nova.\n", x, y);
65 1.1 cgd return;
66 1.1 cgd }
67 1.1 cgd if (ranf(100) < 5)
68 1.1 cgd return (snova(x, y));
69 1.1 cgd printf("Spock: Star at %d,%d gone nova\n", x, y);
70 1.1 cgd
71 1.1 cgd if (ranf(4) != 0)
72 1.1 cgd Sect[x][y] = EMPTY;
73 1.1 cgd else
74 1.1 cgd {
75 1.1 cgd Sect[x][y] = HOLE;
76 1.1 cgd Quad[Ship.quadx][Ship.quady].holes += 1;
77 1.1 cgd }
78 1.1 cgd Quad[Ship.quadx][Ship.quady].stars -= 1;
79 1.1 cgd Game.kills += 1;
80 1.1 cgd for (i = x - 1; i <= x + 1; i++)
81 1.1 cgd {
82 1.1 cgd if (i < 0 || i >= NSECTS)
83 1.1 cgd continue;
84 1.1 cgd for (j = y - 1; j <= y + 1; j++)
85 1.1 cgd {
86 1.1 cgd if (j < 0 || j >= NSECTS)
87 1.1 cgd continue;
88 1.1 cgd se = Sect[i][j];
89 1.1 cgd switch (se)
90 1.1 cgd {
91 1.1 cgd
92 1.1 cgd case EMPTY:
93 1.1 cgd case HOLE:
94 1.1 cgd break;
95 1.1 cgd
96 1.1 cgd case KLINGON:
97 1.1 cgd killk(i, j);
98 1.1 cgd break;
99 1.1 cgd
100 1.1 cgd case STAR:
101 1.1 cgd nova(i, j);
102 1.1 cgd break;
103 1.1 cgd
104 1.1 cgd case INHABIT:
105 1.1 cgd kills(i, j, -1);
106 1.1 cgd break;
107 1.1 cgd
108 1.1 cgd case BASE:
109 1.1 cgd killb(i, j);
110 1.1 cgd Game.killb += 1;
111 1.1 cgd break;
112 1.1 cgd
113 1.1 cgd case ENTERPRISE:
114 1.1 cgd case QUEENE:
115 1.1 cgd se = 2000;
116 1.1 cgd if (Ship.shldup)
117 1.1 cgd if (Ship.shield >= se)
118 1.1 cgd {
119 1.1 cgd Ship.shield -= se;
120 1.1 cgd se = 0;
121 1.1 cgd }
122 1.1 cgd else
123 1.1 cgd {
124 1.1 cgd se -= Ship.shield;
125 1.1 cgd Ship.shield = 0;
126 1.1 cgd }
127 1.1 cgd Ship.energy -= se;
128 1.1 cgd if (Ship.energy <= 0)
129 1.1 cgd lose(L_SUICID);
130 1.1 cgd break;
131 1.1 cgd
132 1.1 cgd default:
133 1.1 cgd printf("Unknown object %c at %d,%d destroyed\n",
134 1.1 cgd se, i, j);
135 1.1 cgd Sect[i][j] = EMPTY;
136 1.1 cgd break;
137 1.1 cgd }
138 1.1 cgd }
139 1.1 cgd }
140 1.1 cgd return;
141 1.1 cgd }
142