2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)move_robs.c 8.1 (Berkeley) 5/31/93";
38 static const char rcsid[] =
39 "$FreeBSD: src/games/robots/move_robs.c,v 1.4 1999/11/30 03:49:19 billf Exp $";
47 * Move the robots around
59 signal(SIGALRM, move_robots);
66 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++) {
69 mvaddch(rp->y, rp->x, ' ');
70 Field[rp->y][rp->x]--;
71 rp->y += sign(My_pos.y - rp->y);
72 rp->x += sign(My_pos.x - rp->x);
75 else if (rp->y >= Y_FIELDSIZE)
76 rp->y = Y_FIELDSIZE - 1;
79 else if (rp->x >= X_FIELDSIZE)
80 rp->x = X_FIELDSIZE - 1;
81 Field[rp->y][rp->x]++;
88 for (rp = Robots; rp < &Robots[MAXROBOTS]; rp++)
91 else if (rp->y == My_pos.y && rp->x == My_pos.x)
93 else if (Field[rp->y][rp->x] > 1) {
94 mvaddch(rp->y, rp->x, HEAP);
102 mvaddch(rp->y, rp->x, ROBOT);
115 if (Dead || Num_robots <= 0)
116 longjmp(End_move, 0);
133 * Add a score to the overall point total
139 move(Y_SCORE, X_SCORE);
145 * Return the sign of the number