move_robs.c revision 1.3 1 1.3 cgd /* $NetBSD: move_robs.c,v 1.3 1995/04/22 10:08:59 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[] = "@(#)move_robs.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.3 cgd static char rcsid[] = "$NetBSD: move_robs.c,v 1.3 1995/04/22 10:08:59 cgd Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd # include "robots.h"
45 1.1 cgd # include <signal.h>
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd * move_robots:
49 1.1 cgd * Move the robots around
50 1.1 cgd */
51 1.1 cgd void
52 1.1 cgd move_robots(was_sig)
53 1.1 cgd bool was_sig;
54 1.1 cgd {
55 1.1 cgd register COORD *rp;
56 1.1 cgd register int y, x;
57 1.1 cgd register int mindist, d;
58 1.1 cgd static COORD newpos;
59 1.1 cgd
60 1.1 cgd if (Real_time)
61 1.1 cgd signal(SIGALRM, move_robots);
62 1.1 cgd # ifdef DEBUG
63 1.1 cgd move(Min.y, Min.x);
64 1.1 cgd addch(inch());
65 1.1 cgd move(Max.y, Max.x);
66 1.1 cgd addch(inch());
67 1.1 cgd # endif DEBUG
68 1.1 cgd for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
69 1.1 cgd if (rp->y < 0)
70 1.1 cgd continue;
71 1.1 cgd mvaddch(rp->y, rp->x, ' ');
72 1.1 cgd Field[rp->y][rp->x]--;
73 1.1 cgd rp->y += sign(My_pos.y - rp->y);
74 1.1 cgd rp->x += sign(My_pos.x - rp->x);
75 1.1 cgd if (rp->y <= 0)
76 1.1 cgd rp->y = 0;
77 1.1 cgd else if (rp->y >= Y_FIELDSIZE)
78 1.1 cgd rp->y = Y_FIELDSIZE - 1;
79 1.1 cgd if (rp->x <= 0)
80 1.1 cgd rp->x = 0;
81 1.1 cgd else if (rp->x >= X_FIELDSIZE)
82 1.1 cgd rp->x = X_FIELDSIZE - 1;
83 1.1 cgd Field[rp->y][rp->x]++;
84 1.1 cgd }
85 1.1 cgd
86 1.1 cgd Min.y = Y_FIELDSIZE;
87 1.1 cgd Min.x = X_FIELDSIZE;
88 1.1 cgd Max.y = 0;
89 1.1 cgd Max.x = 0;
90 1.1 cgd for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
91 1.1 cgd if (rp->y < 0)
92 1.1 cgd continue;
93 1.1 cgd else if (rp->y == My_pos.y && rp->x == My_pos.x)
94 1.1 cgd Dead = TRUE;
95 1.1 cgd else if (Field[rp->y][rp->x] > 1) {
96 1.1 cgd mvaddch(rp->y, rp->x, HEAP);
97 1.1 cgd rp->y = -1;
98 1.1 cgd Num_robots--;
99 1.1 cgd if (Waiting)
100 1.1 cgd Wait_bonus++;
101 1.1 cgd add_score(ROB_SCORE);
102 1.1 cgd }
103 1.1 cgd else {
104 1.1 cgd mvaddch(rp->y, rp->x, ROBOT);
105 1.1 cgd if (rp->y < Min.y)
106 1.1 cgd Min.y = rp->y;
107 1.1 cgd if (rp->x < Min.x)
108 1.1 cgd Min.x = rp->x;
109 1.1 cgd if (rp->y > Max.y)
110 1.1 cgd Max.y = rp->y;
111 1.1 cgd if (rp->x > Max.x)
112 1.1 cgd Max.x = rp->x;
113 1.1 cgd }
114 1.1 cgd
115 1.1 cgd if (was_sig) {
116 1.1 cgd refresh();
117 1.1 cgd if (Dead || Num_robots <= 0)
118 1.1 cgd longjmp(End_move, 0);
119 1.1 cgd }
120 1.1 cgd
121 1.1 cgd # ifdef DEBUG
122 1.1 cgd standout();
123 1.1 cgd move(Min.y, Min.x);
124 1.1 cgd addch(inch());
125 1.1 cgd move(Max.y, Max.x);
126 1.1 cgd addch(inch());
127 1.1 cgd standend();
128 1.1 cgd # endif DEBUG
129 1.1 cgd if (Real_time)
130 1.1 cgd alarm(3);
131 1.1 cgd }
132 1.1 cgd
133 1.1 cgd /*
134 1.1 cgd * add_score:
135 1.1 cgd * Add a score to the overall point total
136 1.1 cgd */
137 1.1 cgd add_score(add)
138 1.1 cgd int add;
139 1.1 cgd {
140 1.1 cgd Score += add;
141 1.1 cgd move(Y_SCORE, X_SCORE);
142 1.1 cgd printw("%d", Score);
143 1.1 cgd }
144 1.1 cgd
145 1.1 cgd /*
146 1.1 cgd * sign:
147 1.1 cgd * Return the sign of the number
148 1.1 cgd */
149 1.1 cgd sign(n)
150 1.1 cgd int n;
151 1.1 cgd {
152 1.1 cgd if (n < 0)
153 1.1 cgd return -1;
154 1.1 cgd else if (n > 0)
155 1.1 cgd return 1;
156 1.1 cgd else
157 1.1 cgd return 0;
158 1.1 cgd }
159