1 /*        $NetBSD: nova.c,v 1.8 2009/05/24 21:44:56 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[] = "@(#)nova.c      8.1 (Berkeley) 5/31/93";
36 #else
37 __RCSID("$NetBSD: nova.c,v 1.8 2009/05/24 21:44:56 dholland Exp $");
38 #endif
39 #endif /* not lint */
40 
41 #include <stdio.h>
42 #include "trek.h"
43 
44 /*
45 **  CAUSE A NOVA TO OCCUR
46 **
47 **        A nova occurs.  It is the result of having a star hit with
48 **        a photon torpedo.  There are several things which may happen.
49 **        The star may not be affected.  It may go nova.  It may turn
50 **        into a black hole.  Any (yummy) it may go supernova.
51 **
52 **        Stars that go nova cause stars which surround them to undergo
53 **        the same probabilistic process.  Klingons next to them are
54 **        destroyed.  And if the starship is next to it, it gets zapped.
55 **        If the zap is too much, it gets destroyed.
56 */
57 
58 void
nova(int x,int y)59 nova(int x, int y)
60 {
61           int       i, j;
62           int       se;
63 
64           if (Sect[x][y] != STAR || Quad[Ship.quadx][Ship.quady].stars < 0)
65                     return;
66           if (ranf(100) < 15) {
67                     printf("Spock: Star at %d,%d failed to nova.\n", x, y);
68                     return;
69           }
70           if (ranf(100) < 5) {
71                     snova(x, y);
72                     return;
73           }
74           printf("Spock: Star at %d,%d gone nova\n", x, y);
75 
76           if (ranf(4) != 0) {
77                     Sect[x][y] = EMPTY;
78           } else {
79                     Sect[x][y] = HOLE;
80                     Quad[Ship.quadx][Ship.quady].holes += 1;
81           }
82           Quad[Ship.quadx][Ship.quady].stars -= 1;
83           Game.kills += 1;
84           for (i = x - 1; i <= x + 1; i++) {
85                     if (i < 0 || i >= NSECTS)
86                               continue;
87                     for (j = y - 1; j <= y + 1; j++) {
88                               if (j < 0 || j >= NSECTS)
89                                         continue;
90                               se = Sect[i][j];
91                               switch (se) {
92 
93                                 case EMPTY:
94                                 case HOLE:
95                                         break;
96 
97                                 case KLINGON:
98                                         killk(i, j);
99                                         break;
100 
101                                 case STAR:
102                                         nova(i, j);
103                                         break;
104 
105                                 case INHABIT:
106                                         kills(i, j, -1);
107                                         break;
108 
109                                 case BASE:
110                                         killb(i, j);
111                                         Game.killb += 1;
112                                         break;
113 
114                                 case ENTERPRISE:
115                                 case QUEENE:
116                                         se = 2000;
117                                         if (Ship.shldup) {
118                                                   if (Ship.shield >= se) {
119                                                             Ship.shield -= se;
120                                                             se = 0;
121                                                   } else {
122                                                             se -= Ship.shield;
123                                                             Ship.shield = 0;
124                                                   }
125                                         }
126                                         Ship.energy -= se;
127                                         if (Ship.energy <= 0)
128                                                   lose(L_SUICID);
129                                         break;
130 
131                                 default:
132                                         printf("Unknown object %c at %d,%d destroyed\n",
133                                                   se, i, j);
134                                         Sect[i][j] = EMPTY;
135                                         break;
136                               }
137                     }
138           }
139           return;
140 }
141