27
edits
Reading order: Difference between revisions
→Reverse reading order
Indyindeed (talk | contribs) |
Tags: Mobile edit Mobile web edit |
||
| Line 3: | Line 3: | ||
== Reverse reading order == | == Reverse reading order == | ||
In the [[MS ruleset]], when searching for the [[Chip]] tile which the player moves, ''reverse reading order'' is used. Chip's Challenge | In the [[MS ruleset]], when searching for the [[Chip]] tile which the player moves, ''reverse reading order'' is used. Chip's Challenge will begin searching from the [[grid]] coordinate [31, 31] and move west, and then move to the next row all the way to row 0 in the same manner. If [0, 0] is reached and no Chip tile exists, the search stops there and the principles of the [[Non-Existence Glitch]] are used to determine what to do. | ||
When any object runs into a [[teleport]], ''reverse wrappable reading order'' is used instead. The teleport's direction is the starting location, and if [0, 0] is reached with no legal exit from a teleport, Chip's Challenge wraps back to [31, 31] until either a valid teleport or the same teleport is reached, whichever comes first. [[Chip's Challenge 2]] also uses ''reverse wrappable reading order'' for [[blue teleport|blue]] and [[yellow teleport]]s. | When any object runs into a [[teleport]], ''reverse wrappable reading order'' is used instead. The teleport's direction is the starting location, and if [0, 0] is reached with no legal exit from a teleport, Chip's Challenge wraps back to [31, 31] until either a valid teleport or the same teleport is reached, whichever comes first. [[Chip's Challenge 2]] also uses ''reverse wrappable reading order'' for [[blue teleport|blue]] and [[yellow teleport]]s. | ||