xref: /dragonfly/games/trek/nova.c (revision 3851e4b8)
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. Neither the name of the University nor the names of its contributors
14  *    may be used to endorse or promote products derived from this software
15  *    without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  * @(#)nova.c	8.1 (Berkeley) 5/31/93
30  * $FreeBSD: src/games/trek/nova.c,v 1.4 1999/11/30 03:49:52 billf Exp $
31  * $DragonFly: src/games/trek/nova.c,v 1.3 2006/09/07 21:19:44 pavalos Exp $
32  */
33 
34 #include "trek.h"
35 
36 /*
37 **  CAUSE A NOVA TO OCCUR
38 **
39 **	A nova occurs.  It is the result of having a star hit with
40 **	a photon torpedo.  There are several things which may happen.
41 **	The star may not be affected.  It may go nova.  It may turn
42 **	into a black hole.  Any (yummy) it may go supernova.
43 **
44 **	Stars that go nova cause stars which surround them to undergo
45 **	the same probabilistic process.  Klingons next to them are
46 **	destroyed.  And if the starship is next to it, it gets zapped.
47 **	If the zap is too much, it gets destroyed.
48 */
49 
50 void
51 nova(int x, int y)
52 {
53 	int	i, j;
54 	int	se;
55 
56 	if (Sect[x][y] != STAR || Quad[Ship.quadx][Ship.quady].stars < 0)
57 		return;
58 	if (ranf(100) < 15) {
59 		printf("Spock: Star at %d,%d failed to nova.\n", x, y);
60 		return;
61 	}
62 	if (ranf(100) < 5) {
63 		snova(x, y);
64 		return;
65 	}
66 	printf("Spock: Star at %d,%d gone nova\n", x, y);
67 
68 	if (ranf(4) != 0)
69 		Sect[x][y] = EMPTY;
70 	else {
71 		Sect[x][y] = HOLE;
72 		Quad[Ship.quadx][Ship.quady].holes += 1;
73 	}
74 	Quad[Ship.quadx][Ship.quady].stars -= 1;
75 	Game.kills += 1;
76 	for (i = x - 1; i <= x + 1; i++) {
77 		if (i < 0 || i >= NSECTS)
78 			continue;
79 		for (j = y - 1; j <= y + 1; j++) {
80 			if (j < 0 || j >= NSECTS)
81 				continue;
82 			se = Sect[i][j];
83 			switch (se) {
84 			  case EMPTY:
85 			  case HOLE:
86 				break;
87 
88 			  case KLINGON:
89 				killk(i, j);
90 				break;
91 
92 			  case STAR:
93 				nova(i, j);
94 				break;
95 
96 			  case INHABIT:
97 				kills(i, j, -1);
98 				break;
99 
100 			  case BASE:
101 				killb(i, j);
102 				Game.killb += 1;
103 				break;
104 
105 			  case ENTERPRISE:
106 			  case QUEENE:
107 				se = 2000;
108 				if (Ship.shldup) {
109 					if (Ship.shield >= se) {
110 						Ship.shield -= se;
111 						se = 0;
112 					} else {
113 						se -= Ship.shield;
114 						Ship.shield = 0;
115 					}
116 				}
117 				Ship.energy -= se;
118 				if (Ship.energy <= 0)
119 					lose(L_SUICID);
120 				break;
121 
122 			  default:
123 				printf("Unknown object %c at %d,%d destroyed\n",
124 					se, i, j);
125 				Sect[i][j] = EMPTY;
126 				break;
127 			}
128 		}
129 	}
130 	return;
131 }
132