move_robs.c revision 1.4 
1/*	$OpenBSD: move_robs.c,v 1.4 2001/08/12 19:19:40 pjanzen Exp $	*/
2/*	$NetBSD: move_robs.c,v 1.3 1995/04/22 10:08:59 cgd Exp $	*/
3
4/*
5 * Copyright (c) 1980, 1993
6 *	The Regents of the University of California.  All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 *    must display the following acknowledgement:
18 *	This product includes software developed by the University of
19 *	California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 *    may be used to endorse or promote products derived from this software
22 *    without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37#ifndef lint
38#if 0
39static char sccsid[] = "@(#)move_robs.c	8.1 (Berkeley) 5/31/93";
40#else
41static char rcsid[] = "$OpenBSD: move_robs.c,v 1.4 2001/08/12 19:19:40 pjanzen Exp $";
42#endif
43#endif /* not lint */
44
45#include	"robots.h"
46
47/*
48 * move_robots:
49 *	Move the robots around
50 */
51void
52move_robots()
53{
54	register COORD	*rp;
55
56#ifdef DEBUG
57	move(Min.y, Min.x);
58	addch(inch());
59	move(Max.y, Max.x);
60	addch(inch());
61#endif /* DEBUG */
62	for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
63		if (rp->y < 0)
64			continue;
65		mvaddch(rp->y, rp->x, ' ');
66		Field[rp->y][rp->x]--;
67		rp->y += sign(My_pos.y - rp->y);
68		rp->x += sign(My_pos.x - rp->x);
69		if (rp->y <= 0)
70			rp->y = 0;
71		else if (rp->y >= Y_FIELDSIZE)
72			rp->y = Y_FIELDSIZE - 1;
73		if (rp->x <= 0)
74			rp->x = 0;
75		else if (rp->x >= X_FIELDSIZE)
76			rp->x = X_FIELDSIZE - 1;
77		Field[rp->y][rp->x]++;
78	}
79
80	Min.y = Y_FIELDSIZE;
81	Min.x = X_FIELDSIZE;
82	Max.y = 0;
83	Max.x = 0;
84	for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
85		if (rp->y < 0)
86			continue;
87		else if (rp->y == My_pos.y && rp->x == My_pos.x)
88			Dead = TRUE;
89		else if (Field[rp->y][rp->x] > 1) {
90			mvaddch(rp->y, rp->x, HEAP);
91			rp->y = -1;
92			Num_robots--;
93			if (Waiting)
94				Wait_bonus++;
95			add_score(ROB_SCORE);
96		}
97		else {
98			mvaddch(rp->y, rp->x, ROBOT);
99			if (rp->y < Min.y)
100				Min.y = rp->y;
101			if (rp->x < Min.x)
102				Min.x = rp->x;
103			if (rp->y > Max.y)
104				Max.y = rp->y;
105			if (rp->x > Max.x)
106				Max.x = rp->x;
107		}
108
109#ifdef DEBUG
110	standout();
111	move(Min.y, Min.x);
112	addch(inch());
113	move(Max.y, Max.x);
114	addch(inch());
115	standend();
116#endif /* DEBUG */
117}
118
119/*
120 * add_score:
121 *	Add a score to the overall point total
122 */
123void
124add_score(add)
125	int	add;
126{
127	Score += add;
128	move(Y_SCORE, X_SCORE);
129	printw("%d", Score);
130}
131
132/*
133 * sign:
134 *	Return the sign of the number
135 */
136int
137sign(n)
138	int	n;
139{
140	if (n < 0)
141		return -1;
142	else if (n > 0)
143		return 1;
144	else
145		return 0;
146}
147