2 * Copyright (c) 1988, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static char sccsid[] = "@(#)move.c 8.1 (Berkeley) 5/31/93";
41 static const char rcsid[] =
48 * This source herein may be modified and/or distributed by anybody who
49 * so desires, with the following restrictions:
50 * 1.) No portion of this notice shall be removed.
51 * 2.) Credit shall not be taken for the creation of this source.
52 * 3.) This code is not to be traded, sold, or used for personal
61 const char *you_can_move_again = "you can move again";
63 extern short cur_room, halluc, blind, levitate;
64 extern short cur_level, max_level;
65 extern short bear_trap, haste_self, confused;
66 extern short e_rings, regeneration, auto_search;
67 extern char hunger_str[];
68 extern boolean being_held, interrupted, r_teleport, passgo;
70 one_move_rogue(dirch, pickup)
84 (void) is_direction(dirch, &d);
85 get_dir_rc(d, &row, &col, 1);
87 if (!can_move(rogue.row, rogue.col, row, col)) {
90 if (being_held || bear_trap) {
91 if (!(dungeon[row][col] & MONSTER)) {
93 message("you are being held", 1);
95 message("you are still stuck in the bear trap", 0);
102 if (rand_percent(R_TELE_PERCENT)) {
104 return(STOPPED_ON_SOMETHING);
107 if (dungeon[row][col] & MONSTER) {
108 rogue_hit(object_at(&level_monsters, row, col), 0);
112 if (dungeon[row][col] & DOOR) {
113 if (cur_room == PASSAGE) {
114 cur_room = get_room_number(row, col);
115 light_up_room(cur_room);
116 wake_room(cur_room, 1, row, col);
118 light_passage(row, col);
120 } else if ((dungeon[rogue.row][rogue.col] & DOOR) &&
121 (dungeon[row][col] & TUNNEL)) {
122 light_passage(row, col);
123 wake_room(cur_room, 0, rogue.row, rogue.col);
124 darken_room(cur_room);
126 } else if (dungeon[row][col] & TUNNEL) {
127 light_passage(row, col);
129 mvaddch(rogue.row, rogue.col, get_dungeon_char(rogue.row, rogue.col));
130 mvaddch(row, col, rogue.fchar);
137 if (dungeon[row][col] & OBJECT) {
138 if (levitate && pickup) {
139 return(STOPPED_ON_SOMETHING);
141 if (pickup && !levitate) {
142 if (obj = pick_up(row, col, &status)) {
144 if (obj->what_is == GOLD) {
148 } else if (!status) {
155 obj = object_at(&level_objects, row, col);
156 (void) strcpy(desc, "moved onto ");
157 get_desc(obj, desc+11);
162 desc[n+1] = obj->ichar;
168 return(STOPPED_ON_SOMETHING);
170 if (dungeon[row][col] & (DOOR | STAIRS | TRAP)) {
171 if ((!levitate) && (dungeon[row][col] & TRAP)) {
172 trap_player(row, col);
175 return(STOPPED_ON_SOMETHING);
177 MVED: if (reg_move()) { /* fainted from hunger */
178 return(STOPPED_ON_SOMETHING);
180 return((confused ? STOPPED_ON_SOMETHING : MOVED));
183 multiple_move_rogue(dirch)
201 if (((m = one_move_rogue((dirch + 96), 1)) == MOVE_FAILED) ||
202 (m == STOPPED_ON_SOMETHING) ||
206 } while (!next_to_something(row, col));
207 if ( (!interrupted) && passgo && (m == MOVE_FAILED) &&
208 (dungeon[rogue.row][rogue.col] & TUNNEL)) {
209 turn_passage(dirch + 96, 0);
220 while ((!interrupted) && (one_move_rogue((dirch + 32), 1) == MOVED)) ;
222 if ( (!interrupted) && passgo &&
223 (dungeon[rogue.row][rogue.col] & TUNNEL)) {
224 turn_passage(dirch + 32, 1);
230 is_passable(row, col)
233 if ((row < MIN_ROW) || (row > (DROWS - 2)) || (col < 0) ||
237 if (dungeon[row][col] & HIDDEN) {
238 return((dungeon[row][col] & TRAP) ? 1 : 0);
240 return(dungeon[row][col] & (FLOOR | TUNNEL | DOOR | STAIRS | TRAP));
243 next_to_something(drow, dcol)
246 short i, j, i_end, j_end, row, col;
247 short pass_count = 0;
256 i_end = (rogue.row < (DROWS-2)) ? 1 : 0;
257 j_end = (rogue.col < (DCOLS-1)) ? 1 : 0;
259 for (i = ((rogue.row > MIN_ROW) ? -1 : 0); i <= i_end; i++) {
260 for (j = ((rogue.col > 0) ? -1 : 0); j <= j_end; j++) {
261 if ((i == 0) && (j == 0)) {
264 if (((rogue.row+i) == drow) && ((rogue.col+j) == dcol)) {
269 s = dungeon[row][col];
273 /* If the rogue used to be right, up, left, down, or right of
274 * row,col, and now isn't, then don't stop */
275 if (s & (MONSTER | OBJECT | STAIRS)) {
276 if (((row == drow) || (col == dcol)) &&
277 (!((row == rogue.row) || (col == rogue.col)))) {
284 if (((row == drow) || (col == dcol)) &&
285 (!((row == rogue.row) || (col == rogue.col)))) {
291 if ((((i - j) == 1) || ((i - j) == -1)) && (s & TUNNEL)) {
292 if (++pass_count > 1) {
296 if ((s & DOOR) && ((i == 0) || (j == 0))) {
304 can_move(row1, col1, row2, col2)
306 if (!is_passable(row2, col2)) {
309 if ((row1 != row2) && (col1 != col2)) {
310 if ((dungeon[row1][col1] & DOOR) || (dungeon[row2][col2] & DOOR)) {
313 if ((!dungeon[row1][col2]) || (!dungeon[row2][col1])) {
323 boolean first_miss = 1;
325 while (!is_direction(ch = rgetchar(), &d)) {
328 message("direction? ", 0);
334 (void) one_move_rogue(ch, 0);
377 check_hunger(msg_only)
383 if (rogue.moves_left == HUNGRY) {
384 (void) strcpy(hunger_str, "hungry");
385 message(hunger_str, 0);
386 print_stats(STAT_HUNGER);
388 if (rogue.moves_left == WEAK) {
389 (void) strcpy(hunger_str, "weak");
390 message(hunger_str, 1);
391 print_stats(STAT_HUNGER);
393 if (rogue.moves_left <= FAINT) {
394 if (rogue.moves_left == FAINT) {
395 (void) strcpy(hunger_str, "faint");
396 message(hunger_str, 1);
397 print_stats(STAT_HUNGER);
399 n = get_rand(0, (FAINT - rogue.moves_left));
402 if (rand_percent(40)) {
405 message("you faint", 1);
406 for (i = 0; i < n; i++) {
411 message(you_can_move_again, 1);
417 if (rogue.moves_left <= STARVE) {
418 killed_by((object *) 0, STARVATION);
423 Subtract 0, i.e. do nothing.
426 rogue.moves_left -= (rogue.moves_left % 2);
433 (void) check_hunger(1);
434 rogue.moves_left -= (rogue.moves_left % 2);
438 (void) check_hunger(1);
450 if ((rogue.moves_left <= HUNGRY) || (cur_level >= max_level)) {
451 fainted = check_hunger(0);
458 if (++m_moves >= 120) {
484 message("you float gently to the ground", 1);
485 if (dungeon[rogue.row][rogue.col] & TRAP) {
486 trap_player(rogue.row, rogue.col);
491 if (!(--haste_self)) {
492 message("you feel yourself slowing down", 0);
496 if (auto_search > 0) {
497 search(auto_search, auto_search);
508 for (i = 0; i < count; i++) {
553 static short heal_exp = -1, n, c = 0;
556 if (rogue.hp_current == rogue.hp_max) {
560 if (rogue.exp != heal_exp) {
561 heal_exp = rogue.exp;
608 if ((rogue.hp_current += regeneration) > rogue.hp_max) {
609 rogue.hp_current = rogue.hp_max;
611 print_stats(STAT_HP);
619 if ((dungeon[nrow][ncol] & TUNNEL) && is_passable(nrow, ncol)) {
625 turn_passage(dir, fast)
629 short crow = rogue.row, ccol = rogue.col, turns = 0;
632 if ((dir != 'h') && can_turn(crow, ccol + 1)) {
636 if ((dir != 'l') && can_turn(crow, ccol - 1)) {
640 if ((dir != 'k') && can_turn(crow + 1, ccol)) {
644 if ((dir != 'j') && can_turn(crow - 1, ccol)) {
649 multiple_move_rogue(ndir - (fast ? 32 : 96));