Difference between revisions of "Underscore"
Jump to navigation
Jump to search
m (kbd) |
(formatting + copyedit pass) |
||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
{{ASCII}} | {{ASCII}} | ||
+ | In ''[[NetHack]]'', the '''underscore''' symbol ('''_''') serves the following purposes: | ||
− | * | + | * {{lightgray|_}} represents an [[altar]]. |
− | * {{cyan|_}} | + | * {{cyan|_}} represents an [[iron chain]]. |
− | |||
+ | * Press {{kbd|_}} to [[travel]] to a map location if the [[command]] is enabled in your [[options]]. | ||
+ | ** The game will prompt you to move a cursor to your desired destination square, or else select a symbol corresponding to a [[dungeon feature]] on that square, and then confirm - you are then moved as part of a shortest-path algorithm to that location. The algorithm fails when there are known [[trap]]s in the way, instead causing you to travel in a straight line to the nearest wall near that trap. | ||
+ | {{nethack-367}} | ||
[[Category:ASCII]] | [[Category:ASCII]] |
Latest revision as of 16:21, 29 October 2023
Printable ASCII characters | ||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
~ | ! | @ | # | $ | % | ^ | & | * | ( | ) | _ | + | space | |||||||||||||||||||||
` | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 0 | - | = | { | } | | | |||||||||||||||||||
Ww | Ee | Rr | Tt | Yy | Uu | Ii | Oo | Pp | : | " | [ | ] | \ | |||||||||||||||||||||
Aa | Ss | Dd | Ff | Gg | Hh | Jj | Kk | Ll | ? | ; | ' | Ctrl | ||||||||||||||||||||||
Zz | Xx | Cc | Vv | Bb | Nn | Mm | , | . | / | < | > | Alt |
In NetHack, the underscore symbol (_) serves the following purposes:
- _ represents an altar.
- _ represents an iron chain.
- Press _ to travel to a map location if the command is enabled in your options.
- The game will prompt you to move a cursor to your desired destination square, or else select a symbol corresponding to a dungeon feature on that square, and then confirm - you are then moved as part of a shortest-path algorithm to that location. The algorithm fails when there are known traps in the way, instead causing you to travel in a straight line to the nearest wall near that trap.