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
33 * @(#)move.c 8.1 (Berkeley) 5/31/93
34 * $FreeBSD: src/games/robots/move.c,v 1.6 1999/11/30 03:49:18 billf Exp $
35 * $DragonFly: src/games/robots/move.c,v 1.3 2006/08/27 21:45:07 pavalos Exp $
38 #include <sys/ttydefaults.h>
44 static bool must_telep(void);
45 static bool do_move(int, int);
46 static bool eaten(COORD *);
50 * Get and execute a move from the player
64 if (Next_move >= Move_list)
65 lastmove = *Next_move;
67 lastmove = -1; /* flag for "first time in" */
69 lastmove = 0; /* Shut up gcc */
72 if (Teleport && must_telep())
79 else if (Num_robots > 1 && Stand_still)
81 else if (Num_robots > 1 && Pattern_roll) {
82 if (*++Next_move == '\0') {
85 Next_move = Move_list;
98 while (isdigit(c = getchar()))
99 Count = Count * 10 + (c - '0');
104 leaveok(stdscr, TRUE);
146 case 'Y': case 'U': case 'H': case 'J':
147 case 'K': case 'L': case 'B': case 'N':
154 leaveok(stdscr, TRUE);
158 if (query("Really quit?"))
165 leaveok(stdscr, TRUE);
171 mvaddch(My_pos.y, My_pos.x, ' ');
173 mvaddch(My_pos.y, My_pos.x, PLAYER);
174 leaveok(stdscr, FALSE);
193 leaveok(stdscr, FALSE);
198 * Must I teleport; i.e., is there anywhere I can move without
208 if (Stand_still && Num_robots > 1 && eaten(&My_pos))
212 for (y = -1; y <= 1; y++) {
213 newpos.y = My_pos.y + y;
214 if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE)
216 for (x = -1; x <= 1; x++) {
217 newpos.x = My_pos.x + x;
218 if (newpos.x <= 0 || newpos.x >= X_FIELDSIZE)
220 if (Field[newpos.y][newpos.x] > 0)
234 do_move(int dy, int dx)
238 newpos.y = My_pos.y + dy;
239 newpos.x = My_pos.x + dx;
240 if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE ||
241 newpos.x <= 0 || newpos.x >= X_FIELDSIZE ||
242 Field[newpos.y][newpos.x] > 0 || eaten(&newpos)) {
245 leaveok(stdscr, FALSE);
246 move(My_pos.y, My_pos.x);
255 else if (dy == 0 && dx == 0)
257 mvaddch(My_pos.y, My_pos.x, ' ');
259 mvaddch(My_pos.y, My_pos.x, PLAYER);
267 * Player would get eaten at this place
274 for (y = pos->y - 1; y <= pos->y + 1; y++) {
275 if (y <= 0 || y >= Y_FIELDSIZE)
277 for (x = pos->x - 1; x <= pos->x + 1; x++) {
278 if (x <= 0 || x >= X_FIELDSIZE)
280 if (Field[y][x] == 1)
289 * Reset the count variables
296 leaveok(stdscr, FALSE);
302 * See if we are jumping, i.e., we should not refresh.
307 return (Jump && (Count || Running || Waiting));