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.c 8.1 (Berkeley) 5/31/93";
38 static const char rcsid[] =
42 #include <sys/ttydefaults.h>
50 * Get and execute a move from the player
63 if (Next_move >= Move_list)
64 lastmove = *Next_move;
66 lastmove = -1; /* flag for "first time in" */
68 lastmove = 0; /* Shut up gcc */
71 if (Teleport && must_telep())
78 else if (Num_robots > 1 && Stand_still)
80 else if (Num_robots > 1 && Pattern_roll) {
81 if (*++Next_move == '\0') {
84 Next_move = Move_list;
97 while (isdigit(c = getchar()))
98 Count = Count * 10 + (c - '0');
103 leaveok(stdscr, TRUE);
145 case 'Y': case 'U': case 'H': case 'J':
146 case 'K': case 'L': case 'B': case 'N':
153 leaveok(stdscr, TRUE);
157 if (query("Really quit?"))
164 leaveok(stdscr, TRUE);
165 /* flushok(stdscr, FALSE); */
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
207 if (Stand_still && Num_robots > 1 && eaten(&My_pos))
211 for (y = -1; y <= 1; y++) {
212 newpos.y = My_pos.y + y;
213 if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE)
215 for (x = -1; x <= 1; x++) {
216 newpos.x = My_pos.x + x;
217 if (newpos.x <= 0 || newpos.x >= X_FIELDSIZE)
219 if (Field[newpos.y][newpos.x] > 0)
237 newpos.y = My_pos.y + dy;
238 newpos.x = My_pos.x + dx;
239 if (newpos.y <= 0 || newpos.y >= Y_FIELDSIZE ||
240 newpos.x <= 0 || newpos.x >= X_FIELDSIZE ||
241 Field[newpos.y][newpos.x] > 0 || eaten(&newpos)) {
244 leaveok(stdscr, FALSE);
245 move(My_pos.y, My_pos.x);
254 else if (dy == 0 && dx == 0)
256 mvaddch(My_pos.y, My_pos.x, ' ');
258 mvaddch(My_pos.y, My_pos.x, PLAYER);
266 * Player would get eaten at this place
273 for (y = pos->y - 1; y <= pos->y + 1; y++) {
274 if (y <= 0 || y >= Y_FIELDSIZE)
276 for (x = pos->x - 1; x <= pos->x + 1; x++) {
277 if (x <= 0 || x >= X_FIELDSIZE)
279 if (Field[y][x] == 1)
288 * Reset the count variables
294 leaveok(stdscr, FALSE);
300 * See if we are jumping, i.e., we should not refresh.
304 return (Jump && (Count || Running || Waiting));