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