Please create an account or Login! Have fun!
Optimization: Difference between revisions
Tylersontag (talk | contribs) (Created page with "'''Optimization''' is the activity of trying to achieve the highest time, or score in Chip's Challenge 2, in a Chip's Challenge level. The highest publicly reported ti...") |
mNo edit summary |
||
| Line 1: | Line 1: | ||
{{stub}} | |||
'''Optimization''' is the activity of trying to achieve the highest time, or score in [[Chip's Challenge 2]], in a [[Chip's Challenge]] level. The highest publicly reported time is known as a [[bold time]], and the ultimate goal of optimization is to meet or exceed this time. | '''Optimization''' is the activity of trying to achieve the highest time, or score in [[Chip's Challenge 2]], in a [[Chip's Challenge]] level. The highest publicly reported time is known as a [[bold time]], and the ultimate goal of optimization is to meet or exceed this time. | ||
There are two facets to optimization: finding the optimal route and executing it. Finding the optimal route can be purely theoretical and helped by techniques like [[ghosting]] or using tools like [[SuperCC]]. However, many bold routes, especially for older level sets like [[CC1]] and [[CCLP2]], are publicly available as an [[AVI]] or a solution in the [[public TWS]], making the act of independently finding a bold route unnecessary. Executing a route is both skill and luck-based and frequently requires techniques like [[boosting]] or the exploitation of glitches like the [[Mouse Panel Glitch]]. The difficulty in finding and route and executing it are often independent: routing [[Doublemaze]] is simple but it is one of the hardest to execute, but routing [[Lemmings]] is chaotic but simple to execute once the route has been found. | There are two facets to optimization: finding the optimal route and executing it. Finding the optimal route can be purely theoretical and helped by techniques like [[ghosting]] or using tools like [[SuperCC]]. However, many bold routes, especially for older level sets like [[CC1]] and [[CCLP2]], are publicly available as an [[AVI]] or a solution in the [[public TWS]], making the act of independently finding a bold route unnecessary. Executing a route is both skill and luck-based and frequently requires techniques like [[boosting]] or the exploitation of glitches like the [[Mouse Panel Glitch]]. The difficulty in finding and route and executing it are often independent: routing [[Doublemaze]] is simple but it is one of the hardest to execute, but routing [[Lemmings]] is chaotic but simple to execute once the route has been found. | ||
[[Category:Terminology]] | [[Category:Terminology]] | ||
Revision as of 23:56, 21 May 2019
Optimization is the activity of trying to achieve the highest time, or score in Chip's Challenge 2, in a Chip's Challenge level. The highest publicly reported time is known as a bold time, and the ultimate goal of optimization is to meet or exceed this time.
There are two facets to optimization: finding the optimal route and executing it. Finding the optimal route can be purely theoretical and helped by techniques like ghosting or using tools like SuperCC. However, many bold routes, especially for older level sets like CC1 and CCLP2, are publicly available as an AVI or a solution in the public TWS, making the act of independently finding a bold route unnecessary. Executing a route is both skill and luck-based and frequently requires techniques like boosting or the exploitation of glitches like the Mouse Panel Glitch. The difficulty in finding and route and executing it are often independent: routing Doublemaze is simple but it is one of the hardest to execute, but routing Lemmings is chaotic but simple to execute once the route has been found.