Administrators, trusted-editors
995
edits
Thanks to...: Difference between revisions
no edit summary
Sharpeye468 (talk | contribs) No edit summary |
Sharpeye468 (talk | contribs) No edit summary |
||
| Line 25: | Line 25: | ||
Ed H. is probably the artist Ed Halley; the other three names are not known. The ''TONY'' mentioned in the password could be surnamed Garcia or Krueger, and is generally assumed to be the former. Tony Krueger was the MS version's author, which is mentioned along with Ed Halley's name in the ''About Chip's Challenge'' popup accessible from the ''Help'' menu. | Ed H. is probably the artist Ed Halley; the other three names are not known. The ''TONY'' mentioned in the password could be surnamed Garcia or Krueger, and is generally assumed to be the former. Tony Krueger was the MS version's author, which is mentioned along with Ed Halley's name in the ''About Chip's Challenge'' popup accessible from the ''Help'' menu. | ||
To complete the level, slide on the [[ice]] and play between the DOUG and T. to reach [[fire boots]] and then down to the exit at (31, 31); or use the [[AVI]] solution to win in 8 seconds, but risking Chip's life. The probability of the optimal solution's success is 1/64: three random [[force floor]]s must all move Chip D | To complete the level, slide on the [[ice]] and play between the DOUG and T. to reach [[fire boots]] and then down to the exit at (31, 31); or use the [[AVI]] solution to win in 8 seconds, but risking Chip's life. The probability of the optimal solution's success is 1/64: three random [[force floor]]s must all move Chip D. With optimal routing, it doesn't matter if the other two force floors in the row are overridden. | ||
== Trivia == | == Trivia == | ||