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