]>
git.cameronkatri.com Git - bsdgames-darwin.git/blob - robots/move.c
1 /* $NetBSD: move.c,v 1.8 1999/05/15 23:56:36 christos Exp $ */
4 * Copyright (c) 1980, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 #include <sys/cdefs.h>
39 static char sccsid
[] = "@(#)move.c 8.1 (Berkeley) 5/31/93";
41 __RCSID("$NetBSD: move.c,v 1.8 1999/05/15 23:56:36 christos Exp $");
51 * Get and execute a move from the player
66 if (Next_move
>= Move_list
)
67 lastmove
= *Next_move
;
69 lastmove
= -1; /* flag for "first time in" */
71 lastmove
= 0; /* Shut up gcc */
74 if (Teleport
&& must_telep())
81 else if (Num_robots
> 1 && Stand_still
)
83 else if (Num_robots
> 1 && Pattern_roll
) {
84 if (*++Next_move
== '\0') {
87 Next_move
= Move_list
;
103 while (isdigit(c
= getchar()))
104 Count
= Count
* 10 + (c
- '0');
109 leaveok(stdscr
, TRUE
);
151 case 'Y': case 'U': case 'H': case 'J':
152 case 'K': case 'L': case 'B': case 'N':
159 leaveok(stdscr
, TRUE
);
163 if (query("Really quit?"))
170 leaveok(stdscr
, TRUE
);
176 mvaddch(My_pos
.y
, My_pos
.x
, ' ');
178 mvaddch(My_pos
.y
, My_pos
.x
, PLAYER
);
179 leaveok(stdscr
, FALSE
);
198 leaveok(stdscr
, FALSE
);
203 * Must I teleport; i.e., is there anywhere I can move without
213 if (Stand_still
&& Num_robots
> 1 && eaten(&My_pos
))
217 for (y
= -1; y
<= 1; y
++) {
218 newpos
.y
= My_pos
.y
+ y
;
219 if (newpos
.y
<= 0 || newpos
.y
>= Y_FIELDSIZE
)
221 for (x
= -1; x
<= 1; x
++) {
222 newpos
.x
= My_pos
.x
+ x
;
223 if (newpos
.x
<= 0 || newpos
.x
>= X_FIELDSIZE
)
225 if (Field
[newpos
.y
][newpos
.x
] > 0)
244 newpos
.y
= My_pos
.y
+ dy
;
245 newpos
.x
= My_pos
.x
+ dx
;
246 if (newpos
.y
<= 0 || newpos
.y
>= Y_FIELDSIZE
||
247 newpos
.x
<= 0 || newpos
.x
>= X_FIELDSIZE
||
248 Field
[newpos
.y
][newpos
.x
] > 0 || eaten(&newpos
)) {
251 leaveok(stdscr
, FALSE
);
252 move(My_pos
.y
, My_pos
.x
);
261 else if (dy
== 0 && dx
== 0)
263 mvaddch(My_pos
.y
, My_pos
.x
, ' ');
265 mvaddch(My_pos
.y
, My_pos
.x
, PLAYER
);
273 * Player would get eaten at this place
281 for (y
= pos
->y
- 1; y
<= pos
->y
+ 1; y
++) {
282 if (y
<= 0 || y
>= Y_FIELDSIZE
)
284 for (x
= pos
->x
- 1; x
<= pos
->x
+ 1; x
++) {
285 if (x
<= 0 || x
>= X_FIELDSIZE
)
287 if (Field
[y
][x
] == 1)
296 * Reset the count variables
303 leaveok(stdscr
, FALSE
);
309 * See if we are jumping, i.e., we should not refresh.
314 return (Jump
&& (Count
|| Running
|| Waiting
));