3 * @brief プレイヤーのコマンド処理1 / Movement commands (part 1)
6 * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke
8 * This software may be copied and distributed for educational, research,
9 * and not for profit purposes provided that this copyright and statement
10 * are included in all such copies. Other copyrights may also apply.
13 * The running algorithm: -CJS-
15 * In the diagrams below, the player has just arrived in the
16 * grid marked as '@', and he has just come from a grid marked
17 * as 'o', and he is about to enter the grid marked as 'x'.
19 * Of course, if the "requested" move was impossible, then you
20 * will of course be blocked, and will stop.
22 * Overview: You keep moving until something interesting happens.
23 * If you are in an enclosed space, you follow corners. This is
24 * the usual corridor scheme. If you are in an open space, you go
25 * straight, but stop before entering enclosed space. This is
26 * analogous to reaching doorways. If you have enclosed space on
27 * one side only (that is, running along side a wall) stop if
28 * your wall opens out, or your open space closes in. Either case
29 * corresponds to a doorway.
31 * What happens depends on what you can really SEE. (i.e. if you
32 * have no light, then running along a dark corridor is JUST like
33 * running in a dark room.) The algorithm works equally well in
34 * corridors, rooms, mine tailings, earthquake rubble, etc, etc.
36 * These conditions are kept in static memory:
37 * find_openarea You are in the open on at least one
39 * find_breakleft You have a wall on the left, and will
41 * find_breakright You have a wall on the right, and will
44 * To initialize these conditions, we examine the grids adjacent
45 * to the grid marked 'x', two on each side (marked 'L' and 'R').
46 * If either one of the two grids on a given side is seen to be
47 * closed, then that side is considered to be closed. If both
48 * sides are closed, then it is an enclosed (corridor) run.
54 * Looking at more than just the immediate squares is
55 * significant. Consider the following case. A run along the
56 * corridor will stop just before entering the center point,
57 * because a choice is clearly established. Running in any of
58 * three available directions will be defined as a corridor run.
59 * Note that a minor hack is inserted to make the angled corridor
60 * entry (with one side blocked near and the other side blocked
61 * further away from the runner) work correctly. The runner moves
62 * diagonally, but then saves the previous direction as being
63 * straight into the gap. Otherwise, the tail end of the other
64 * entry would be perceived as an alternative on the next move.
72 * Likewise, a run along a wall, and then into a doorway (two
73 * runs) will work correctly. A single run rightwards from \@ will
74 * stop at 1. Another run right and down will enter the corridor
75 * and make the corner, stopping at the 2.
77 * \#\#\#\#\#\#\#\#\#\#\#\#\#\#\#\#\#\#
79 * \#\#\#\#\#\#\#\#\#\#\# \#\#\#\#\#\#
81 * \#\#\#\#\#\#\#\#\#\#\#\#\#
83 * After any move, the function area_affect is called to
84 * determine the new surroundings, and the direction of
85 * subsequent moves. It examines the current player location
86 * (at which the runner has just arrived) and the previous
87 * direction (from which the runner is considered to have come).
89 * Moving one square in some direction places you adjacent to
90 * three or five new squares (for straight and diagonal moves
91 * respectively) to which you were not previously adjacent,
92 * marked as '!' in the diagrams below.
95 * .o@@! (normal) .o.! (diagonal)
96 * ...! (east) ..@@! (south east)
99 * You STOP if any of the new squares are interesting in any way:
100 * for example, if they contain visible monsters or treasure.
102 * You STOP if any of the newly adjacent squares seem to be open,
103 * and you are also looking for a break on that side. (that is,
104 * find_openarea AND find_break).
106 * You STOP if any of the newly adjacent squares do NOT seem to be
107 * open and you are in an open area, and that side was previously
110 * Corners: If you are not in the open (i.e. you are in a corridor)
111 * and there is only one way to go in the new squares, then turn in
112 * that direction. If there are more than two new ways to go, STOP.
113 * If there are two ways to go, and those ways are separated by a
114 * square which does not seem to be open, then STOP.
116 * Otherwise, we have a potential corner. There are two new open
117 * squares, which are also adjacent. One of the new squares is
118 * diagonally located, the other is straight on (as in the diagram).
119 * We consider two more squares further out (marked below as ?).
121 * We assign "option" to the straight-on grid, and "option2" to the
122 * diagonal grid, and "check_dir" to the grid marked 's'.
128 * If they are both seen to be closed, then it is seen that no benefit
129 * is gained from moving straight. It is a known corner. To cut the
130 * corner, go diagonally, otherwise go straight, but pretend you
131 * stepped diagonally into that next location for a full view next
132 * time. Conversely, if one of the ? squares is not seen to be closed,
133 * then there is a potential choice. We check to see whether it is a
134 * potential corner or an intersection/room entrance. If the square
135 * two spaces straight ahead, and the space marked with 's' are both
136 * unknown space, then it is a potential corner and enter if
137 * find_examine is set, otherwise must stop because it is not a
138 * corner. (find_examine option is removed and always is TRUE.)
145 #include "projection.h"
147 #include "artifact.h"
148 #include "player-status.h"
153 * @brief プレイヤー攻撃の種族スレイング倍率計算
154 * @param mult 算出前の基本倍率(/10倍)
155 * @param flgs スレイフラグ配列
156 * @param m_ptr 目標モンスターの構造体参照ポインタ
157 * @return スレイング加味後の倍率(/10倍)
159 static MULTIPLY mult_slaying(MULTIPLY mult, const BIT_FLAGS* flgs, const monster_type* m_ptr)
161 static const struct slay_table_t {
163 BIT_FLAGS affect_race_flag;
166 size_t r_flag_offset;
168 #define OFFSET(X) offsetof(monster_race, X)
169 {TR_SLAY_ANIMAL, RF3_ANIMAL, 25, OFFSET(flags3), OFFSET(r_flags3)},
170 {TR_KILL_ANIMAL, RF3_ANIMAL, 40, OFFSET(flags3), OFFSET(r_flags3)},
171 {TR_SLAY_EVIL, RF3_EVIL, 20, OFFSET(flags3), OFFSET(r_flags3)},
172 {TR_KILL_EVIL, RF3_EVIL, 35, OFFSET(flags3), OFFSET(r_flags3)},
173 {TR_SLAY_GOOD, RF3_GOOD, 20, OFFSET(flags3), OFFSET(r_flags3)},
174 {TR_KILL_GOOD, RF3_GOOD, 35, OFFSET(flags3), OFFSET(r_flags3)},
175 {TR_SLAY_HUMAN, RF2_HUMAN, 25, OFFSET(flags2), OFFSET(r_flags2)},
176 {TR_KILL_HUMAN, RF2_HUMAN, 40, OFFSET(flags2), OFFSET(r_flags2)},
177 {TR_SLAY_UNDEAD, RF3_UNDEAD, 30, OFFSET(flags3), OFFSET(r_flags3)},
178 {TR_KILL_UNDEAD, RF3_UNDEAD, 50, OFFSET(flags3), OFFSET(r_flags3)},
179 {TR_SLAY_DEMON, RF3_DEMON, 30, OFFSET(flags3), OFFSET(r_flags3)},
180 {TR_KILL_DEMON, RF3_DEMON, 50, OFFSET(flags3), OFFSET(r_flags3)},
181 {TR_SLAY_ORC, RF3_ORC, 30, OFFSET(flags3), OFFSET(r_flags3)},
182 {TR_KILL_ORC, RF3_ORC, 50, OFFSET(flags3), OFFSET(r_flags3)},
183 {TR_SLAY_TROLL, RF3_TROLL, 30, OFFSET(flags3), OFFSET(r_flags3)},
184 {TR_KILL_TROLL, RF3_TROLL, 50, OFFSET(flags3), OFFSET(r_flags3)},
185 {TR_SLAY_GIANT, RF3_GIANT, 30, OFFSET(flags3), OFFSET(r_flags3)},
186 {TR_KILL_GIANT, RF3_GIANT, 50, OFFSET(flags3), OFFSET(r_flags3)},
187 {TR_SLAY_DRAGON, RF3_DRAGON, 30, OFFSET(flags3), OFFSET(r_flags3)},
188 {TR_KILL_DRAGON, RF3_DRAGON, 50, OFFSET(flags3), OFFSET(r_flags3)},
192 monster_race* r_ptr = &r_info[m_ptr->r_idx];
194 for (i = 0; i < sizeof(slay_table) / sizeof(slay_table[0]); ++ i)
196 const struct slay_table_t* p = &slay_table[i];
198 if ((have_flag(flgs, p->slay_flag)) &&
199 (atoffset(u32b, r_ptr, p->flag_offset) & p->affect_race_flag))
201 if (is_original_ap_and_seen(m_ptr))
203 atoffset(u32b, r_ptr, p->r_flag_offset) |= p->affect_race_flag;
206 mult = MAX(mult, p->slay_mult);
214 * @brief プレイヤー攻撃の属性スレイング倍率計算
215 * @param mult 算出前の基本倍率(/10倍)
216 * @param flgs スレイフラグ配列
217 * @param m_ptr 目標モンスターの構造体参照ポインタ
218 * @return スレイング加味後の倍率(/10倍)
220 static MULTIPLY mult_brand(MULTIPLY mult, const BIT_FLAGS* flgs, const monster_type* m_ptr)
222 static const struct brand_table_t {
224 BIT_FLAGS resist_mask;
227 {TR_BRAND_ACID, RFR_EFF_IM_ACID_MASK, 0U },
228 {TR_BRAND_ELEC, RFR_EFF_IM_ELEC_MASK, 0U },
229 {TR_BRAND_FIRE, RFR_EFF_IM_FIRE_MASK, RF3_HURT_FIRE},
230 {TR_BRAND_COLD, RFR_EFF_IM_COLD_MASK, RF3_HURT_COLD},
231 {TR_BRAND_POIS, RFR_EFF_IM_POIS_MASK, 0U },
234 monster_race* r_ptr = &r_info[m_ptr->r_idx];
236 for (i = 0; i < sizeof(brand_table) / sizeof(brand_table[0]); ++ i)
238 const struct brand_table_t* p = &brand_table[i];
240 if (have_flag(flgs, p->brand_flag))
242 /* Notice immunity */
243 if (r_ptr->flagsr & p->resist_mask)
245 if (is_original_ap_and_seen(m_ptr))
247 r_ptr->r_flagsr |= (r_ptr->flagsr & p->resist_mask);
251 /* Otherwise, take the damage */
252 else if (r_ptr->flags3 & p->hurt_flag)
254 if (is_original_ap_and_seen(m_ptr))
256 r_ptr->r_flags3 |= p->hurt_flag;
259 mult = MAX(mult, 50);
263 mult = MAX(mult, 25);
272 * @brief ダメージにスレイ要素を加える総合処理ルーチン /
273 * Extract the "total damage" from a given object hitting a given monster.
274 * @param o_ptr 使用武器オブジェクトの構造体参照ポインタ
275 * @param tdam 現在算出途中のダメージ値
276 * @param m_ptr 目標モンスターの構造体参照ポインタ
278 * @param thrown 射撃処理ならばTRUEを指定する
279 * @return 総合的なスレイを加味したダメージ値
281 * Note that "flasks of oil" do NOT do fire damage, although they\n
282 * certainly could be made to do so. XXX XXX\n
284 * Note that most brands and slays are x3, except Slay Animal (x2),\n
285 * Slay Evil (x2), and Kill dragon (x5).\n
287 HIT_POINT tot_dam_aux(object_type *o_ptr, HIT_POINT tdam, monster_type *m_ptr, BIT_FLAGS mode, bool thrown)
291 BIT_FLAGS flgs[TR_FLAG_SIZE];
292 object_flags(o_ptr, flgs);
293 torch_flags(o_ptr, flgs); /* torches has secret flags */
298 if (p_ptr->special_attack & (ATTACK_ACID)) add_flag(flgs, TR_BRAND_ACID);
299 if (p_ptr->special_attack & (ATTACK_COLD)) add_flag(flgs, TR_BRAND_COLD);
300 if (p_ptr->special_attack & (ATTACK_ELEC)) add_flag(flgs, TR_BRAND_ELEC);
301 if (p_ptr->special_attack & (ATTACK_FIRE)) add_flag(flgs, TR_BRAND_FIRE);
302 if (p_ptr->special_attack & (ATTACK_POIS)) add_flag(flgs, TR_BRAND_POIS);
305 /* Hex - Slay Good (Runesword) */
306 if (hex_spelling(HEX_RUNESWORD)) add_flag(flgs, TR_SLAY_GOOD);
308 /* Some "weapons" and "ammo" do extra damage */
321 mult = mult_slaying(mult, flgs, m_ptr);
323 /* Elemental Brand */
324 mult = mult_brand(mult, flgs, m_ptr);
327 if (p_ptr->pclass == CLASS_SAMURAI)
329 mult = mult_hissatsu(mult, flgs, m_ptr, mode);
333 if ((p_ptr->pclass != CLASS_SAMURAI) && (have_flag(flgs, TR_FORCE_WEAPON)) && (p_ptr->csp > (o_ptr->dd * o_ptr->ds / 5)))
335 p_ptr->csp -= (1+(o_ptr->dd * o_ptr->ds / 5));
336 p_ptr->redraw |= (PR_MANA);
337 mult = mult * 3 / 2 + 20;
340 /* Hack -- The Nothung cause special damage to Fafner */
341 if ((o_ptr->name1 == ART_NOTHUNG) && (m_ptr->r_idx == MON_FAFNER))
346 if (mult > 150) mult = 150;
348 /* Return the total damage */
349 return (tdam * mult / 10);
354 * @brief 地形やその上のアイテムの隠された要素を明かす /
355 * Search for hidden things
356 * @param y 対象となるマスのY座標
357 * @param x 対象となるマスのX座標
360 static void discover_hidden_things(POSITION y, POSITION x)
362 OBJECT_IDX this_o_idx, next_o_idx = 0;
367 if (c_ptr->mimic && is_trap(c_ptr->feat))
372 msg_print(_("トラップを発見した。", "You have found a trap."));
374 disturb(FALSE, TRUE);
378 if (is_hidden_door(c_ptr))
380 msg_print(_("隠しドアを発見した。", "You have found a secret door."));
385 disturb(FALSE, FALSE);
388 /* Scan all objects in the grid */
389 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
392 o_ptr = &o_list[this_o_idx];
394 /* Acquire next object */
395 next_o_idx = o_ptr->next_o_idx;
397 /* Skip non-chests */
398 if (o_ptr->tval != TV_CHEST) continue;
400 /* Skip non-trapped chests */
401 if (!chest_traps[o_ptr->pval]) continue;
404 if (!object_is_known(o_ptr))
406 msg_print(_("箱に仕掛けられたトラップを発見した!", "You have discovered a trap on the chest!"));
412 disturb(FALSE, FALSE);
418 * @brief プレイヤーの探索処理判定
426 /* Start with base search ability */
427 chance = p_ptr->skill_srh;
429 /* Penalize various conditions */
430 if (p_ptr->blind || no_lite()) chance = chance / 10;
431 if (p_ptr->confused || p_ptr->image) chance = chance / 10;
433 /* Search the nearby grids, which are always in bounds */
434 for (i = 0; i < 9; ++ i)
436 /* Sometimes, notice things */
437 if (randint0(100) < chance)
439 discover_hidden_things(p_ptr->y + ddy_ddd[i], p_ptr->x + ddx_ddd[i]);
446 * @brief プレイヤーがオブジェクトを拾った際のメッセージ表示処理 /
447 * Helper routine for py_pickup() and py_pickup_floor().
448 * @param o_idx 取得したオブジェクトの参照ID
451 * アイテムを拾った際に「2つのケーキを持っている」\n
452 * "You have two cakes." とアイテムを拾った後の合計のみの表示がオリジナル\n
454 * あるという指摘をうけたので、「~を拾った、~を持っている」という表示\n
456 * Add the given dungeon object to the character's inventory.\n
457 * Delete the object afterwards.\n
459 void py_pickup_aux(OBJECT_IDX o_idx)
464 GAME_TEXT o_name[MAX_NLEN];
465 GAME_TEXT old_name[MAX_NLEN];
469 GAME_TEXT o_name[MAX_NLEN];
474 o_ptr = &o_list[o_idx];
477 object_desc(old_name, o_ptr, OD_NAME_ONLY);
478 object_desc_kosuu(kazu_str, o_ptr);
479 hirottakazu = o_ptr->number;
481 /* Carry the object */
482 slot = inven_carry(o_ptr);
484 /* Get the object again */
485 o_ptr = &inventory[slot];
487 delete_object_idx(o_idx);
489 if (p_ptr->pseikaku == SEIKAKU_MUNCHKIN)
491 bool old_known = identify_item(o_ptr);
493 /* Auto-inscription/destroy */
494 autopick_alter_item(slot, (bool)(destroy_identify && !old_known));
496 /* If it is destroyed, don't pick it up */
497 if (o_ptr->marked & OM_AUTODESTROY) return;
500 object_desc(o_name, o_ptr, 0);
503 if ((o_ptr->name1 == ART_CRIMSON) && (p_ptr->pseikaku == SEIKAKU_COMBAT))
505 msg_format("こうして、%sは『クリムゾン』を手に入れた。", p_ptr->name);
506 msg_print("しかし今、『混沌のサーペント』の放ったモンスターが、");
507 msg_format("%sに襲いかかる...", p_ptr->name);
513 msg_format("%s(%c)を持っている。",o_name, index_to_label(slot));
517 if (o_ptr->number > hirottakazu) {
518 msg_format("%s拾って、%s(%c)を持っている。",
519 kazu_str, o_name, index_to_label(slot));
521 msg_format("%s(%c)を拾った。", o_name, index_to_label(slot));
525 strcpy(record_o_name, old_name);
527 msg_format("You have %s (%c).", o_name, index_to_label(slot));
528 strcpy(record_o_name, o_name);
533 check_find_art_quest_completion(o_ptr);
538 * @brief プレイヤーがオブジェクト上に乗った際の表示処理
539 * @param pickup 自動拾い処理を行うならばTRUEとする
542 * Player "wants" to pick up an object or gold.
543 * Note that we ONLY handle things that can be picked up.
544 * See "move_player()" for handling of other things.
546 void carry(bool pickup)
548 cave_type *c_ptr = &cave[p_ptr->y][p_ptr->x];
550 OBJECT_IDX this_o_idx, next_o_idx = 0;
552 GAME_TEXT o_name[MAX_NLEN];
554 /* Recenter the map around the player */
557 p_ptr->update |= (PU_MONSTERS);
558 p_ptr->redraw |= (PR_MAP);
559 p_ptr->window |= (PW_OVERHEAD);
562 /* Automatically pickup/destroy/inscribe items */
563 autopick_pickup_items(c_ptr);
567 py_pickup_floor(pickup);
571 /* Scan the pile of objects */
572 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
575 o_ptr = &o_list[this_o_idx];
577 #ifdef ALLOW_EASY_SENSE /* TNB */
579 /* Option: Make item sensing easy */
582 /* Sense the object */
583 (void)sense_object(o_ptr);
586 #endif /* ALLOW_EASY_SENSE -- TNB */
588 object_desc(o_name, o_ptr, 0);
590 /* Acquire next object */
591 next_o_idx = o_ptr->next_o_idx;
593 /* Hack -- disturb */
594 disturb(FALSE, FALSE);
597 if (o_ptr->tval == TV_GOLD)
599 int value = (long)o_ptr->pval;
601 /* Delete the gold */
602 delete_object_idx(this_o_idx);
604 msg_format(_(" $%ld の価値がある%sを見つけた。", "You collect %ld gold pieces worth of %s."),
605 (long)value, o_name);
609 /* Collect the gold */
613 p_ptr->redraw |= (PR_GOLD);
614 p_ptr->window |= (PW_PLAYER);
617 /* Pick up objects */
620 /* Hack - some objects were handled in autopick_pickup_items(). */
621 if (o_ptr->marked & OM_NOMSG)
623 /* Clear the flag. */
624 o_ptr->marked &= ~OM_NOMSG;
628 msg_format(_("%sがある。", "You see %s."), o_name);
631 /* Note that the pack is too full */
632 else if (!inven_carry_okay(o_ptr))
634 msg_format(_("ザックには%sを入れる隙間がない。", "You have no room for %s."), o_name);
637 /* Pick up the item (if requested and allowed) */
642 /* Hack -- query every item */
643 if (carry_query_flag)
645 char out_val[MAX_NLEN+20];
646 sprintf(out_val, _("%sを拾いますか? ", "Pick up %s? "), o_name);
647 okay = get_check(out_val);
650 /* Attempt to pick up an object. */
653 /* Pick up the object */
654 py_pickup_aux(this_o_idx);
663 * @brief パターンによる移動制限処理
664 * @param c_y プレイヤーの移動元Y座標
665 * @param c_x プレイヤーの移動元X座標
666 * @param n_y プレイヤーの移動先Y座標
667 * @param n_x プレイヤーの移動先X座標
668 * @return 移動処理が可能である場合(可能な場合に選択した場合)TRUEを返す。
670 bool pattern_seq(POSITION c_y, POSITION c_x, POSITION n_y, POSITION n_x)
672 feature_type *cur_f_ptr = &f_info[cave[c_y][c_x].feat];
673 feature_type *new_f_ptr = &f_info[cave[n_y][n_x].feat];
674 bool is_pattern_tile_cur = have_flag(cur_f_ptr->flags, FF_PATTERN);
675 bool is_pattern_tile_new = have_flag(new_f_ptr->flags, FF_PATTERN);
676 int pattern_type_cur, pattern_type_new;
678 if (!is_pattern_tile_cur && !is_pattern_tile_new) return TRUE;
680 pattern_type_cur = is_pattern_tile_cur ? cur_f_ptr->subtype : NOT_PATTERN_TILE;
681 pattern_type_new = is_pattern_tile_new ? new_f_ptr->subtype : NOT_PATTERN_TILE;
683 if (pattern_type_new == PATTERN_TILE_START)
685 if (!is_pattern_tile_cur && !p_ptr->confused && !p_ptr->stun && !p_ptr->image)
687 if (get_check(_("パターンの上を歩き始めると、全てを歩かなければなりません。いいですか?",
688 "If you start walking the Pattern, you must walk the whole way. Ok? ")))
696 else if ((pattern_type_new == PATTERN_TILE_OLD) ||
697 (pattern_type_new == PATTERN_TILE_END) ||
698 (pattern_type_new == PATTERN_TILE_WRECKED))
700 if (is_pattern_tile_cur)
706 msg_print(_("パターンの上を歩くにはスタート地点から歩き始めなくてはなりません。",
707 "You must start walking the Pattern from the startpoint."));
712 else if ((pattern_type_new == PATTERN_TILE_TELEPORT) ||
713 (pattern_type_cur == PATTERN_TILE_TELEPORT))
717 else if (pattern_type_cur == PATTERN_TILE_START)
719 if (is_pattern_tile_new)
723 msg_print(_("パターンの上は正しい順序で歩かねばなりません。", "You must walk the Pattern in correct order."));
727 else if ((pattern_type_cur == PATTERN_TILE_OLD) ||
728 (pattern_type_cur == PATTERN_TILE_END) ||
729 (pattern_type_cur == PATTERN_TILE_WRECKED))
731 if (!is_pattern_tile_new)
733 msg_print(_("パターンを踏み外してはいけません。", "You may not step off from the Pattern."));
743 if (!is_pattern_tile_cur)
745 msg_print(_("パターンの上を歩くにはスタート地点から歩き始めなくてはなりません。",
746 "You must start walking the Pattern from the startpoint."));
752 byte ok_move = PATTERN_TILE_START;
753 switch (pattern_type_cur)
756 ok_move = PATTERN_TILE_2;
759 ok_move = PATTERN_TILE_3;
762 ok_move = PATTERN_TILE_4;
765 ok_move = PATTERN_TILE_1;
769 msg_format(_("おかしなパターン歩行、%d。", "Funny Pattern walking, %d."), pattern_type_cur);
771 return TRUE; /* Goof-up */
774 if ((pattern_type_new == ok_move) || (pattern_type_new == pattern_type_cur))
778 if (!is_pattern_tile_new)
779 msg_print(_("パターンを踏み外してはいけません。", "You may not step off from the Pattern."));
781 msg_print(_("パターンの上は正しい順序で歩かねばなりません。", "You must walk the Pattern in correct order."));
791 * @brief プレイヤーが地形踏破可能かを返す
792 * @param feature 判定したい地形ID
793 * @param mode 移動に関するオプションフラグ
794 * @return 移動可能ならばTRUEを返す
796 bool player_can_enter(FEAT_IDX feature, BIT_FLAGS16 mode)
798 feature_type *f_ptr = &f_info[feature];
800 if (p_ptr->riding) return monster_can_cross_terrain(feature, &r_info[m_list[p_ptr->riding].r_idx], mode | CEM_RIDING);
802 if (have_flag(f_ptr->flags, FF_PATTERN))
804 if (!(mode & CEM_P_CAN_ENTER_PATTERN)) return FALSE;
807 if (have_flag(f_ptr->flags, FF_CAN_FLY) && p_ptr->levitation) return TRUE;
808 if (have_flag(f_ptr->flags, FF_CAN_SWIM) && p_ptr->can_swim) return TRUE;
809 if (have_flag(f_ptr->flags, FF_CAN_PASS) && p_ptr->pass_wall) return TRUE;
811 if (!have_flag(f_ptr->flags, FF_MOVE)) return FALSE;
818 * @brief 移動に伴うプレイヤーのステータス変化処理
821 * @param mpe_mode 移動オプションフラグ
822 * @return プレイヤーが死亡やフロア離脱を行わず、実際に移動が可能ならばTRUEを返す。
824 bool move_player_effect(POSITION ny, POSITION nx, BIT_FLAGS mpe_mode)
826 POSITION oy = p_ptr->y;
827 POSITION ox = p_ptr->x;
828 cave_type *c_ptr = &cave[ny][nx];
829 cave_type *oc_ptr = &cave[oy][ox];
830 feature_type *f_ptr = &f_info[c_ptr->feat];
831 feature_type *of_ptr = &f_info[oc_ptr->feat];
833 if (!(mpe_mode & MPE_STAYING))
835 MONSTER_IDX om_idx = oc_ptr->m_idx;
836 MONSTER_IDX nm_idx = c_ptr->m_idx;
841 /* Hack -- For moving monster or riding player's moving */
842 if (!(mpe_mode & MPE_DONT_SWAP_MON))
844 /* Swap two monsters */
845 c_ptr->m_idx = om_idx;
846 oc_ptr->m_idx = nm_idx;
848 if (om_idx > 0) /* Monster on old spot (or p_ptr->riding) */
850 monster_type *om_ptr = &m_list[om_idx];
853 update_monster(om_idx, TRUE);
856 if (nm_idx > 0) /* Monster on new spot */
858 monster_type *nm_ptr = &m_list[nm_idx];
861 update_monster(nm_idx, TRUE);
868 /* Check for new panel (redraw map) */
871 if (mpe_mode & MPE_FORGET_FLOW)
875 p_ptr->update |= (PU_UN_VIEW);
876 p_ptr->redraw |= (PR_MAP);
879 p_ptr->update |= (PU_VIEW | PU_LITE | PU_FLOW | PU_MON_LITE | PU_DISTANCE);
880 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
882 /* Remove "unsafe" flag */
883 if ((!p_ptr->blind && !no_lite()) || !is_trap(c_ptr->feat)) c_ptr->info &= ~(CAVE_UNSAFE);
885 /* For get everything when requested hehe I'm *NASTY* */
886 if (dun_level && (d_info[p_ptr->dungeon_idx].flags1 & DF1_FORGET)) wiz_dark();
887 if (mpe_mode & MPE_HANDLE_STUFF) handle_stuff();
889 if (p_ptr->pclass == CLASS_NINJA)
891 if (c_ptr->info & (CAVE_GLOW)) set_superstealth(FALSE);
892 else if (p_ptr->cur_lite <= 0) set_superstealth(TRUE);
895 if ((p_ptr->action == ACTION_HAYAGAKE) &&
896 (!have_flag(f_ptr->flags, FF_PROJECT) ||
897 (!p_ptr->levitation && have_flag(f_ptr->flags, FF_DEEP))))
899 msg_print(_("ここでは素早く動けない。", "You cannot run in here."));
900 set_action(ACTION_NONE);
902 if (p_ptr->prace == RACE_MERFOLK)
904 if(have_flag(f_ptr->flags, FF_WATER) ^ have_flag(of_ptr->flags, FF_WATER))
906 p_ptr->update |= PU_BONUS;
907 update_creature(p_ptr);
912 if (mpe_mode & MPE_ENERGY_USE)
914 if (music_singing(MUSIC_WALL))
916 (void)project(0, 0, p_ptr->y, p_ptr->x, (60 + p_ptr->lev), GF_DISINTEGRATE,
917 PROJECT_KILL | PROJECT_ITEM, -1);
919 if (!player_bold(ny, nx) || p_ptr->is_dead || p_ptr->leaving) return FALSE;
922 /* Spontaneous Searching */
923 if ((p_ptr->skill_fos >= 50) || (0 == randint0(50 - p_ptr->skill_fos)))
928 /* Continuous Searching */
929 if (p_ptr->action == ACTION_SEARCH)
935 /* Handle "objects" */
936 if (!(mpe_mode & MPE_DONT_PICKUP))
938 carry((mpe_mode & MPE_DO_PICKUP) ? TRUE : FALSE);
941 /* Handle "store doors" */
942 if (have_flag(f_ptr->flags, FF_STORE))
944 disturb(FALSE, TRUE);
947 /* Hack -- Enter store */
948 command_new = SPECIAL_KEY_STORE;
951 /* Handle "building doors" -KMW- */
952 else if (have_flag(f_ptr->flags, FF_BLDG))
954 disturb(FALSE, TRUE);
957 /* Hack -- Enter building */
958 command_new = SPECIAL_KEY_BUILDING;
961 /* Handle quest areas -KMW- */
962 else if (have_flag(f_ptr->flags, FF_QUEST_ENTER))
964 disturb(FALSE, TRUE);
967 /* Hack -- Enter quest level */
968 command_new = SPECIAL_KEY_QUEST;
971 else if (have_flag(f_ptr->flags, FF_QUEST_EXIT))
973 if (quest[p_ptr->inside_quest].type == QUEST_TYPE_FIND_EXIT)
975 complete_quest(p_ptr->inside_quest);
980 p_ptr->inside_quest = c_ptr->special;
985 p_ptr->leaving = TRUE;
989 else if (have_flag(f_ptr->flags, FF_HIT_TRAP) && !(mpe_mode & MPE_STAYING))
991 disturb(FALSE, TRUE);
994 if (c_ptr->mimic || have_flag(f_ptr->flags, FF_SECRET))
996 msg_print(_("トラップだ!", "You found a trap!"));
999 disclose_grid(p_ptr->y, p_ptr->x);
1003 hit_trap((mpe_mode & MPE_BREAK_TRAP) ? TRUE : FALSE);
1005 if (!player_bold(ny, nx) || p_ptr->is_dead || p_ptr->leaving) return FALSE;
1008 /* Warn when leaving trap detected region */
1009 if (!(mpe_mode & MPE_STAYING) && (disturb_trap_detect || alert_trap_detect)
1010 && p_ptr->dtrap && !(c_ptr->info & CAVE_IN_DETECT))
1012 /* No duplicate warning */
1013 p_ptr->dtrap = FALSE;
1015 /* You are just on the edge */
1016 if (!(c_ptr->info & CAVE_UNSAFE))
1018 if (alert_trap_detect)
1020 msg_print(_("* 注意:この先はトラップの感知範囲外です! *", "*Leaving trap detect region!*"));
1023 if (disturb_trap_detect) disturb(FALSE, TRUE);
1027 return player_bold(ny, nx) && !p_ptr->is_dead && !p_ptr->leaving;
1031 * @brief 該当地形のトラップがプレイヤーにとって無効かどうかを判定して返す
1033 * @return トラップが自動的に無効ならばTRUEを返す
1035 bool trap_can_be_ignored(FEAT_IDX feat)
1037 feature_type *f_ptr = &f_info[feat];
1039 if (!have_flag(f_ptr->flags, FF_TRAP)) return TRUE;
1041 switch (f_ptr->subtype)
1045 case TRAP_SPIKED_PIT:
1046 case TRAP_POISON_PIT:
1047 if (p_ptr->levitation) return TRUE;
1050 if (p_ptr->anti_tele) return TRUE;
1053 if (p_ptr->immune_fire) return TRUE;
1056 if (p_ptr->immune_acid) return TRUE;
1059 if (p_ptr->resist_blind) return TRUE;
1062 if (p_ptr->resist_conf) return TRUE;
1065 if (p_ptr->resist_pois) return TRUE;
1068 if (p_ptr->free_act) return TRUE;
1077 * Determine if a "boundary" grid is "floor mimic"
1079 #define boundary_floor(C, F, MF) \
1080 ((C)->mimic && permanent_wall(F) && \
1081 (have_flag((MF)->flags, FF_MOVE) || have_flag((MF)->flags, FF_CAN_FLY)) && \
1082 have_flag((MF)->flags, FF_PROJECT) && \
1083 !have_flag((MF)->flags, FF_OPEN))
1087 * @brief 該当地形のトラップがプレイヤーにとって無効かどうかを判定して返す /
1088 * Move player in the given direction, with the given "pickup" flag.
1090 * @param do_pickup 罠解除を試みながらの移動ならばTRUE
1091 * @param break_trap トラップ粉砕処理を行うならばTRUE
1092 * @return 実際に移動が行われたならばTRUEを返す。
1094 * This routine should (probably) always induce energy expenditure.\n
1096 * Note that moving will *always* take a turn, and will *always* hit\n
1097 * any monster which might be in the destination grid. Previously,\n
1098 * moving into walls was "free" and did NOT hit invisible monsters.\n
1100 void move_player(DIRECTION dir, bool do_pickup, bool break_trap)
1102 /* Find the result of moving */
1103 POSITION y = p_ptr->y + ddy[dir];
1104 POSITION x = p_ptr->x + ddx[dir];
1106 /* Examine the destination */
1107 cave_type *c_ptr = &cave[y][x];
1109 feature_type *f_ptr = &f_info[c_ptr->feat];
1111 monster_type *m_ptr;
1113 monster_type *riding_m_ptr = &m_list[p_ptr->riding];
1114 monster_race *riding_r_ptr = &r_info[p_ptr->riding ? riding_m_ptr->r_idx : 0]; /* Paranoia */
1116 GAME_TEXT m_name[MAX_NLEN];
1118 bool p_can_enter = player_can_enter(c_ptr->feat, CEM_P_CAN_ENTER_PATTERN);
1119 bool p_can_kill_walls = FALSE;
1120 bool stormbringer = FALSE;
1122 bool oktomove = TRUE;
1123 bool do_past = FALSE;
1126 if (!dun_level && !p_ptr->wild_mode &&
1127 ((x == 0) || (x == MAX_WID - 1) ||
1128 (y == 0) || (y == MAX_HGT - 1)))
1130 /* Can the player enter the grid? */
1131 if (c_ptr->mimic && player_can_enter(c_ptr->mimic, 0))
1133 /* Hack: move to new area */
1134 if ((y == 0) && (x == 0))
1136 p_ptr->wilderness_y--;
1137 p_ptr->wilderness_x--;
1138 p_ptr->oldpy = cur_hgt - 2;
1139 p_ptr->oldpx = cur_wid - 2;
1140 ambush_flag = FALSE;
1143 else if ((y == 0) && (x == MAX_WID - 1))
1145 p_ptr->wilderness_y--;
1146 p_ptr->wilderness_x++;
1147 p_ptr->oldpy = cur_hgt - 2;
1149 ambush_flag = FALSE;
1152 else if ((y == MAX_HGT - 1) && (x == 0))
1154 p_ptr->wilderness_y++;
1155 p_ptr->wilderness_x--;
1157 p_ptr->oldpx = cur_wid - 2;
1158 ambush_flag = FALSE;
1161 else if ((y == MAX_HGT - 1) && (x == MAX_WID - 1))
1163 p_ptr->wilderness_y++;
1164 p_ptr->wilderness_x++;
1167 ambush_flag = FALSE;
1172 p_ptr->wilderness_y--;
1173 p_ptr->oldpy = cur_hgt - 2;
1175 ambush_flag = FALSE;
1178 else if (y == MAX_HGT - 1)
1180 p_ptr->wilderness_y++;
1183 ambush_flag = FALSE;
1188 p_ptr->wilderness_x--;
1189 p_ptr->oldpx = cur_wid - 2;
1191 ambush_flag = FALSE;
1194 else if (x == MAX_WID - 1)
1196 p_ptr->wilderness_x++;
1199 ambush_flag = FALSE;
1202 p_ptr->leaving = TRUE;
1203 take_turn(p_ptr, 100);;
1208 /* "Blocked" message appears later */
1209 /* oktomove = FALSE; */
1210 p_can_enter = FALSE;
1213 m_ptr = &m_list[c_ptr->m_idx];
1215 if (inventory[INVEN_RARM].name1 == ART_STORMBRINGER) stormbringer = TRUE;
1216 if (inventory[INVEN_LARM].name1 == ART_STORMBRINGER) stormbringer = TRUE;
1218 /* Player can not walk through "walls"... */
1219 /* unless in Shadow Form */
1220 p_can_kill_walls = p_ptr->kill_wall && have_flag(f_ptr->flags, FF_HURT_DISI) &&
1221 (!p_can_enter || !have_flag(f_ptr->flags, FF_LOS)) &&
1222 !have_flag(f_ptr->flags, FF_PERMANENT);
1224 /* Hack -- attack monsters */
1225 if (c_ptr->m_idx && (m_ptr->ml || p_can_enter || p_can_kill_walls))
1227 monster_race *r_ptr = &r_info[m_ptr->r_idx];
1229 /* Attack -- only if we can see it OR it is not in a wall */
1230 if (!is_hostile(m_ptr) &&
1231 !(p_ptr->confused || p_ptr->image || !m_ptr->ml || p_ptr->stun ||
1232 ((p_ptr->muta2 & MUT2_BERS_RAGE) && p_ptr->shero)) &&
1233 pattern_seq(p_ptr->y, p_ptr->x, y, x) && (p_can_enter || p_can_kill_walls))
1235 /* Disturb the monster */
1236 (void)set_monster_csleep(c_ptr->m_idx, 0);
1238 /* Extract monster name (or "it") */
1239 monster_desc(m_name, m_ptr, 0);
1243 /* Auto-Recall if possible and visible */
1244 if (!p_ptr->image) monster_race_track(m_ptr->ap_r_idx);
1246 /* Track a new monster */
1247 health_track(c_ptr->m_idx);
1251 if ((stormbringer && (randint1(1000) > 666)) || (p_ptr->pclass == CLASS_BERSERKER))
1256 else if (monster_can_cross_terrain(cave[p_ptr->y][p_ptr->x].feat, r_ptr, 0))
1262 msg_format(_("%^sが邪魔だ!", "%^s is in your way!"), m_name);
1267 /* now continue on to 'movement' */
1276 if (oktomove && p_ptr->riding)
1278 if (riding_r_ptr->flags1 & RF1_NEVER_MOVE)
1280 msg_print(_("動けない!", "Can't move!"));
1283 disturb(FALSE, TRUE);
1285 else if (MON_MONFEAR(riding_m_ptr))
1287 GAME_TEXT steed_name[MAX_NLEN];
1288 monster_desc(steed_name, riding_m_ptr, 0);
1289 msg_format(_("%sが恐怖していて制御できない。", "%^s is too scared to control."), steed_name);
1291 disturb(FALSE, TRUE);
1293 else if (p_ptr->riding_ryoute)
1296 disturb(FALSE, TRUE);
1298 else if (have_flag(f_ptr->flags, FF_CAN_FLY) && (riding_r_ptr->flags7 & RF7_CAN_FLY))
1302 else if (have_flag(f_ptr->flags, FF_CAN_SWIM) && (riding_r_ptr->flags7 & RF7_CAN_SWIM))
1306 else if (have_flag(f_ptr->flags, FF_WATER) &&
1307 !(riding_r_ptr->flags7 & RF7_AQUATIC) &&
1308 (have_flag(f_ptr->flags, FF_DEEP) || (riding_r_ptr->flags2 & RF2_AURA_FIRE)))
1310 msg_format(_("%sの上に行けない。", "Can't swim."), f_name + f_info[get_feat_mimic(c_ptr)].name);
1313 disturb(FALSE, TRUE);
1315 else if (!have_flag(f_ptr->flags, FF_WATER) && (riding_r_ptr->flags7 & RF7_AQUATIC))
1317 msg_format(_("%sから上がれない。", "Can't land."), f_name + f_info[get_feat_mimic(&cave[p_ptr->y][p_ptr->x])].name);
1320 disturb(FALSE, TRUE);
1322 else if (have_flag(f_ptr->flags, FF_LAVA) && !(riding_r_ptr->flagsr & RFR_EFF_IM_FIRE_MASK))
1324 msg_format(_("%sの上に行けない。", "Too hot to go through."), f_name + f_info[get_feat_mimic(c_ptr)].name);
1327 disturb(FALSE, TRUE);
1330 if (oktomove && MON_STUNNED(riding_m_ptr) && one_in_(2))
1332 GAME_TEXT steed_name[MAX_NLEN];
1333 monster_desc(steed_name, riding_m_ptr, 0);
1334 msg_format(_("%sが朦朧としていてうまく動けない!", "You cannot control stunned %s!"), steed_name);
1336 disturb(FALSE, TRUE);
1344 else if (!have_flag(f_ptr->flags, FF_MOVE) && have_flag(f_ptr->flags, FF_CAN_FLY) && !p_ptr->levitation)
1346 msg_format(_("空を飛ばないと%sの上には行けない。", "You need to fly to go through the %s."), f_name + f_info[get_feat_mimic(c_ptr)].name);
1353 * Player can move through trees and
1354 * has effective -10 speed
1355 * Rangers can move without penality
1357 else if (have_flag(f_ptr->flags, FF_TREE) && !p_can_kill_walls)
1359 if ((p_ptr->pclass != CLASS_RANGER) && !p_ptr->levitation && (!p_ptr->riding || !(riding_r_ptr->flags8 & RF8_WILD_WOOD))) p_ptr->energy_use *= 2;
1363 /* Disarm a visible trap */
1364 else if ((do_pickup != easy_disarm) && have_flag(f_ptr->flags, FF_DISARM) && !c_ptr->mimic)
1366 if (!trap_can_be_ignored(c_ptr->feat))
1368 (void)do_cmd_disarm_aux(y, x, dir);
1374 /* Player can not walk through "walls" unless in wraith form...*/
1375 else if (!p_can_enter && !p_can_kill_walls)
1377 /* Feature code (applying "mimic" field) */
1378 FEAT_IDX feat = get_feat_mimic(c_ptr);
1379 feature_type *mimic_f_ptr = &f_info[feat];
1380 concptr name = f_name + mimic_f_ptr->name;
1384 /* Notice things in the dark */
1385 if (!(c_ptr->info & CAVE_MARK) && !player_can_see_bold(y, x))
1387 /* Boundary floor mimic */
1388 if (boundary_floor(c_ptr, f_ptr, mimic_f_ptr))
1390 msg_print(_("それ以上先には進めないようだ。", "You feel you cannot go any more."));
1393 /* Wall (or secret door) */
1397 msg_format("%sが行く手をはばんでいるようだ。", name);
1399 msg_format("You feel %s %s blocking your way.",
1400 is_a_vowel(name[0]) ? "an" : "a", name);
1403 c_ptr->info |= (CAVE_MARK);
1411 /* Boundary floor mimic */
1412 if (boundary_floor(c_ptr, f_ptr, mimic_f_ptr))
1414 msg_print(_("それ以上先には進めない。", "You cannot go any more."));
1415 if (!(p_ptr->confused || p_ptr->stun || p_ptr->image))
1419 /* Wall (or secret door) */
1423 if (easy_open && is_closed_door(feat) && easy_open_door(y, x)) return;
1426 msg_format("%sが行く手をはばんでいる。", name);
1428 msg_format("There is %s %s blocking your way.",
1429 is_a_vowel(name[0]) ? "an" : "a", name);
1433 * Well, it makes sense that you lose time bumping into
1434 * a wall _if_ you are confused, stunned or blind; but
1435 * typing mistakes should not cost you a turn...
1437 if (!(p_ptr->confused || p_ptr->stun || p_ptr->image))
1442 disturb(FALSE, TRUE);
1444 if (!boundary_floor(c_ptr, f_ptr, mimic_f_ptr)) sound(SOUND_HITWALL);
1447 /* Normal movement */
1448 if (oktomove && !pattern_seq(p_ptr->y, p_ptr->x, y, x))
1450 if (!(p_ptr->confused || p_ptr->stun || p_ptr->image))
1455 /* To avoid a loop with running */
1456 disturb(FALSE, TRUE);
1461 /* Normal movement */
1464 u32b mpe_mode = MPE_ENERGY_USE;
1468 if (!process_warning(x, y))
1470 p_ptr->energy_use = 25;
1477 msg_format(_("%sを押し退けた。", "You push past %s."), m_name);
1480 /* Change oldpx and oldpy to place the player well when going back to big mode */
1481 if (p_ptr->wild_mode)
1483 if (ddy[dir] > 0) p_ptr->oldpy = 1;
1484 if (ddy[dir] < 0) p_ptr->oldpy = MAX_HGT - 2;
1485 if (ddy[dir] == 0) p_ptr->oldpy = MAX_HGT / 2;
1486 if (ddx[dir] > 0) p_ptr->oldpx = 1;
1487 if (ddx[dir] < 0) p_ptr->oldpx = MAX_WID - 2;
1488 if (ddx[dir] == 0) p_ptr->oldpx = MAX_WID / 2;
1491 if (p_can_kill_walls)
1493 cave_alter_feat(y, x, FF_HURT_DISI);
1495 /* Update some things -- similar to GF_KILL_WALL */
1496 p_ptr->update |= (PU_FLOW);
1499 /* sound(SOUND_WALK); */
1501 if (do_pickup != always_pickup) mpe_mode |= MPE_DO_PICKUP;
1502 if (break_trap) mpe_mode |= MPE_BREAK_TRAP;
1504 (void)move_player_effect(y, x, mpe_mode);
1509 static bool ignore_avoid_run;
1512 * @brief ダッシュ移動処理中、移動先のマスが既知の壁かどうかを判定する /
1513 * Hack -- Check for a "known wall" (see below)
1514 * @param dir 想定する移動方向ID
1517 * @return 移動先が既知の壁ならばTRUE
1519 static bool see_wall(DIRECTION dir, POSITION y, POSITION x)
1523 /* Get the new location */
1527 /* Illegal grids are not known walls */
1528 if (!in_bounds2(y, x)) return (FALSE);
1531 c_ptr = &cave[y][x];
1533 /* Must be known to the player */
1534 if (c_ptr->info & (CAVE_MARK))
1536 /* Feature code (applying "mimic" field) */
1537 s16b feat = get_feat_mimic(c_ptr);
1538 feature_type *f_ptr = &f_info[feat];
1540 /* Wall grids are known walls */
1541 if (!player_can_enter(feat, 0)) return !have_flag(f_ptr->flags, FF_DOOR);
1543 /* Don't run on a tree unless explicitly requested */
1544 if (have_flag(f_ptr->flags, FF_AVOID_RUN) && !ignore_avoid_run)
1547 /* Don't run in a wall */
1548 if (!have_flag(f_ptr->flags, FF_MOVE) && !have_flag(f_ptr->flags, FF_CAN_FLY))
1549 return !have_flag(f_ptr->flags, FF_DOOR);
1557 * @brief ダッシュ移動処理中、移動先のマスか未知の地形かどうかを判定する /
1558 * Hack -- Check for an "unknown corner" (see below)
1559 * @param dir 想定する移動方向ID
1562 * @return 移動先が未知の地形ならばTRUE
1564 static bool see_nothing(DIRECTION dir, POSITION y, POSITION x)
1566 /* Get the new location */
1570 /* Illegal grids are unknown */
1571 if (!in_bounds2(y, x)) return (TRUE);
1573 /* Memorized grids are always known */
1574 if (cave[y][x].info & (CAVE_MARK)) return (FALSE);
1576 /* Viewable door/wall grids are known */
1577 if (player_can_see_bold(y, x)) return (FALSE);
1585 * Hack -- allow quick "cycling" through the legal directions
1587 static byte cycle[] = { 1, 2, 3, 6, 9, 8, 7, 4, 1, 2, 3, 6, 9, 8, 7, 4, 1 };
1590 * Hack -- map each direction into the "middle" of the "cycle[]" array
1592 static byte chome[] = { 0, 8, 9, 10, 7, 0, 11, 6, 5, 4 };
1595 * The direction we are running
1597 static DIRECTION find_current;
1600 * The direction we came from
1602 static DIRECTION find_prevdir;
1605 * We are looking for open area
1607 static bool find_openarea;
1610 * We are looking for a break
1612 static bool find_breakright;
1613 static bool find_breakleft;
1616 * @brief ダッシュ処理の導入 /
1617 * Initialize the running algorithm for a new direction.
1620 * Diagonal Corridor -- allow diaginal entry into corridors.\n
1622 * Blunt Corridor -- If there is a wall two spaces ahead and\n
1623 * we seem to be in a corridor, then force a turn into the side\n
1624 * corridor, must be moving straight into a corridor here. ???\n
1626 * Diagonal Corridor Blunt Corridor (?)\n
1631 static void run_init(DIRECTION dir)
1633 int row, col, deepleft, deepright;
1634 int i, shortleft, shortright;
1636 /* Save the direction */
1639 /* Assume running straight */
1642 /* Assume looking for open area */
1643 find_openarea = TRUE;
1645 /* Assume not looking for breaks */
1646 find_breakright = find_breakleft = FALSE;
1648 /* Assume no nearby walls */
1649 deepleft = deepright = FALSE;
1650 shortright = shortleft = FALSE;
1652 p_ptr->run_py = p_ptr->y;
1653 p_ptr->run_px = p_ptr->x;
1655 /* Find the destination grid */
1656 row = p_ptr->y + ddy[dir];
1657 col = p_ptr->x + ddx[dir];
1659 ignore_avoid_run = cave_have_flag_bold(row, col, FF_AVOID_RUN);
1661 /* Extract cycle index */
1664 /* Check for walls */
1665 if (see_wall(cycle[i+1], p_ptr->y, p_ptr->x))
1667 find_breakleft = TRUE;
1670 else if (see_wall(cycle[i+1], row, col))
1672 find_breakleft = TRUE;
1676 /* Check for walls */
1677 if (see_wall(cycle[i-1], p_ptr->y, p_ptr->x))
1679 find_breakright = TRUE;
1682 else if (see_wall(cycle[i-1], row, col))
1684 find_breakright = TRUE;
1688 /* Looking for a break */
1689 if (find_breakleft && find_breakright)
1691 /* Not looking for open area */
1692 find_openarea = FALSE;
1694 /* Hack -- allow angled corridor entry */
1697 if (deepleft && !deepright)
1699 find_prevdir = cycle[i - 1];
1701 else if (deepright && !deepleft)
1703 find_prevdir = cycle[i + 1];
1707 /* Hack -- allow blunt corridor entry */
1708 else if (see_wall(cycle[i], row, col))
1710 if (shortleft && !shortright)
1712 find_prevdir = cycle[i - 2];
1714 else if (shortright && !shortleft)
1716 find_prevdir = cycle[i + 2];
1724 * @brief ダッシュ移動が継続できるかどうかの判定 /
1725 * Update the current "run" path
1727 * ダッシュ移動が継続できるならばTRUEを返す。
1728 * Return TRUE if the running should be stopped
1730 static bool run_test(void)
1732 DIRECTION prev_dir, new_dir, check_dir = 0;
1735 int option = 0, option2 = 0;
1738 feature_type *f_ptr;
1740 /* Where we came from */
1741 prev_dir = find_prevdir;
1744 /* Range of newly adjacent grids */
1745 max = (prev_dir & 0x01) + 1;
1747 /* break run when leaving trap detected region */
1748 if ((disturb_trap_detect || alert_trap_detect)
1749 && p_ptr->dtrap && !(cave[p_ptr->y][p_ptr->x].info & CAVE_IN_DETECT))
1751 /* No duplicate warning */
1752 p_ptr->dtrap = FALSE;
1754 /* You are just on the edge */
1755 if (!(cave[p_ptr->y][p_ptr->x].info & CAVE_UNSAFE))
1757 if (alert_trap_detect)
1759 msg_print(_("* 注意:この先はトラップの感知範囲外です! *", "*Leaving trap detect region!*"));
1762 if (disturb_trap_detect)
1770 /* Look at every newly adjacent square. */
1771 for (i = -max; i <= max; i++)
1773 OBJECT_IDX this_o_idx, next_o_idx = 0;
1776 new_dir = cycle[chome[prev_dir] + i];
1779 row = p_ptr->y + ddy[new_dir];
1780 col = p_ptr->x + ddx[new_dir];
1783 c_ptr = &cave[row][col];
1785 /* Feature code (applying "mimic" field) */
1786 feat = get_feat_mimic(c_ptr);
1787 f_ptr = &f_info[feat];
1789 /* Visible monsters abort running */
1792 monster_type *m_ptr = &m_list[c_ptr->m_idx];
1794 /* Visible monster */
1795 if (m_ptr->ml) return (TRUE);
1798 /* Visible objects abort running */
1799 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1802 o_ptr = &o_list[this_o_idx];
1804 /* Acquire next object */
1805 next_o_idx = o_ptr->next_o_idx;
1807 /* Visible object */
1808 if (o_ptr->marked & OM_FOUND) return (TRUE);
1811 /* Assume unknown */
1814 /* Check memorized grids */
1815 if (c_ptr->info & (CAVE_MARK))
1817 bool notice = have_flag(f_ptr->flags, FF_NOTICE);
1819 if (notice && have_flag(f_ptr->flags, FF_MOVE))
1822 if (find_ignore_doors && have_flag(f_ptr->flags, FF_DOOR) && have_flag(f_ptr->flags, FF_CLOSE))
1824 /* Option -- ignore */
1829 else if (find_ignore_stairs && have_flag(f_ptr->flags, FF_STAIRS))
1831 /* Option -- ignore */
1836 else if (have_flag(f_ptr->flags, FF_LAVA) && (p_ptr->immune_fire || IS_INVULN()))
1843 else if (have_flag(f_ptr->flags, FF_WATER) && have_flag(f_ptr->flags, FF_DEEP) &&
1844 (p_ptr->levitation || p_ptr->can_swim || (p_ptr->total_weight <= weight_limit())))
1851 /* Interesting feature */
1852 if (notice) return (TRUE);
1854 /* The grid is "visible" */
1858 /* Analyze unknown grids and floors considering mimic */
1859 if (inv || !see_wall(0, row, col))
1861 /* Looking for open area */
1867 /* The first new direction. */
1873 /* Three new directions. Stop running. */
1879 /* Two non-adjacent new directions. Stop running. */
1880 else if (option != cycle[chome[prev_dir] + i - 1])
1885 /* Two new (adjacent) directions (case 1) */
1886 else if (new_dir & 0x01)
1888 check_dir = cycle[chome[prev_dir] + i - 2];
1892 /* Two new (adjacent) directions (case 2) */
1895 check_dir = cycle[chome[prev_dir] + i + 1];
1901 /* Obstacle, while looking for open area */
1908 /* Break to the right */
1909 find_breakright = TRUE;
1914 /* Break to the left */
1915 find_breakleft = TRUE;
1921 /* Looking for open area */
1924 /* Hack -- look again */
1925 for (i = -max; i < 0; i++)
1927 /* Unknown grid or non-wall */
1928 if (!see_wall(cycle[chome[prev_dir] + i], p_ptr->y, p_ptr->x))
1930 /* Looking to break right */
1931 if (find_breakright)
1940 /* Looking to break left */
1948 /* Hack -- look again */
1949 for (i = max; i > 0; i--)
1951 /* Unknown grid or non-wall */
1952 if (!see_wall(cycle[chome[prev_dir] + i], p_ptr->y, p_ptr->x))
1954 /* Looking to break left */
1964 /* Looking to break right */
1965 if (find_breakright)
1973 /* Not looking for open area */
1985 /* Primary option */
1986 find_current = option;
1988 /* No other options */
1989 find_prevdir = option;
1992 /* Two options, examining corners */
1995 /* Primary option */
1996 find_current = option;
1998 /* Hack -- allow curving */
1999 find_prevdir = option2;
2002 /* Two options, pick one */
2005 /* Get next location */
2006 row = p_ptr->y + ddy[option];
2007 col = p_ptr->x + ddx[option];
2009 /* Don't see that it is closed off. */
2010 /* This could be a potential corner or an intersection. */
2011 if (!see_wall(option, row, col) ||
2012 !see_wall(check_dir, row, col))
2014 /* Can not see anything ahead and in the direction we */
2015 /* are turning, assume that it is a potential corner. */
2016 if (see_nothing(option, row, col) &&
2017 see_nothing(option2, row, col))
2019 find_current = option;
2020 find_prevdir = option2;
2023 /* STOP: we are next to an intersection or a room */
2030 /* This corner is seen to be enclosed; we cut the corner. */
2033 find_current = option2;
2034 find_prevdir = option2;
2037 /* This corner is seen to be enclosed, and we */
2038 /* deliberately go the long way. */
2041 find_current = option;
2042 find_prevdir = option2;
2047 /* About to hit a known wall, stop */
2048 if (see_wall(find_current, p_ptr->y, p_ptr->x))
2060 * @brief 継続的なダッシュ処理 /
2061 * Take one step along the current "run" path
2062 * @param dir 移動を試みる方向ID
2065 void run_step(DIRECTION dir)
2070 /* Ignore AVOID_RUN on a first step */
2071 ignore_avoid_run = TRUE;
2073 /* Hack -- do not start silly run */
2074 if (see_wall(dir, p_ptr->y, p_ptr->x))
2076 sound(SOUND_HITWALL);
2078 msg_print(_("その方向には走れません。", "You cannot run in that direction."));
2080 disturb(FALSE, FALSE);
2094 disturb(FALSE, FALSE);
2100 /* Decrease the run counter */
2101 if (--running <= 0) return;
2104 take_turn(p_ptr, 100);;
2106 /* Move the player, using the "pickup" flag */
2107 move_player(find_current, FALSE, FALSE);
2109 if (player_bold(p_ptr->run_py, p_ptr->run_px))
2113 disturb(FALSE, FALSE);
2121 * @brief トラベル機能の判定処理 /
2122 * Test for traveling
2123 * @param prev_dir 前回移動を行った元の方角ID
2126 static DIRECTION travel_test(DIRECTION prev_dir)
2128 DIRECTION new_dir = 0;
2130 const cave_type *c_ptr;
2133 /* Cannot travel when blind */
2134 if (p_ptr->blind || no_lite())
2136 msg_print(_("目が見えない!", "You cannot see!"));
2140 /* break run when leaving trap detected region */
2141 if ((disturb_trap_detect || alert_trap_detect)
2142 && p_ptr->dtrap && !(cave[p_ptr->y][p_ptr->x].info & CAVE_IN_DETECT))
2144 /* No duplicate warning */
2145 p_ptr->dtrap = FALSE;
2147 /* You are just on the edge */
2148 if (!(cave[p_ptr->y][p_ptr->x].info & CAVE_UNSAFE))
2150 if (alert_trap_detect)
2152 msg_print(_("* 注意:この先はトラップの感知範囲外です! *", "*Leaving trap detect region!*"));
2155 if (disturb_trap_detect)
2163 /* Range of newly adjacent grids */
2164 max = (prev_dir & 0x01) + 1;
2166 /* Look at every newly adjacent square. */
2167 for (i = -max; i <= max; i++)
2170 DIRECTION dir = cycle[chome[prev_dir] + i];
2173 POSITION row = p_ptr->y + ddy[dir];
2174 POSITION col = p_ptr->x + ddx[dir];
2177 c_ptr = &cave[row][col];
2179 /* Visible monsters abort running */
2182 monster_type *m_ptr = &m_list[c_ptr->m_idx];
2184 /* Visible monster */
2185 if (m_ptr->ml) return (0);
2190 /* Travel cost of current grid */
2191 cost = travel.cost[p_ptr->y][p_ptr->x];
2193 /* Determine travel direction */
2194 for (i = 0; i < 8; ++ i) {
2195 int dir_cost = travel.cost[p_ptr->y+ddy_ddd[i]][p_ptr->x+ddx_ddd[i]];
2197 if (dir_cost < cost)
2204 if (!new_dir) return (0);
2206 /* Access newly move grid */
2207 c_ptr = &cave[p_ptr->y+ddy[new_dir]][p_ptr->x+ddx[new_dir]];
2209 /* Close door abort traveling */
2210 if (!easy_open && is_closed_door(c_ptr->feat)) return (0);
2212 /* Visible and unignorable trap abort tarveling */
2213 if (!c_ptr->mimic && !trap_can_be_ignored(c_ptr->feat)) return (0);
2221 * @brief トラベル機能の実装 /
2225 void travel_step(void)
2227 /* Get travel direction */
2228 travel.dir = travel_test(travel.dir);
2232 if (travel.run == 255)
2234 msg_print(_("道筋が見つかりません!", "No route is found!"));
2235 travel.y = travel.x = 0;
2237 disturb(FALSE, TRUE);
2241 take_turn(p_ptr, 100);;
2243 move_player(travel.dir, always_pickup, FALSE);
2245 if ((p_ptr->y == travel.y) && (p_ptr->x == travel.x))
2248 travel.y = travel.x = 0;
2250 else if (travel.run > 0)
2254 Term_xtra(TERM_XTRA_DELAY, delay_factor);