Optimization: Difference between revisions

Optimization (edit)

Revision as of 22:10, 6 November 2019

38 bytes removed , 6 November 2019

m

Ghosting ResidentSleeper

Tylersontag

Bureaucrats, Interface administrators, Administrators

1,356

edits

Revision as of 16:19, 1 August 2019 (edit) Indyindeed (talk \| contribs) mNo edit summary ← Older edit		Revision as of 22:10, 6 November 2019 (edit) (undo) Tylersontag (talk \| contribs) m (Ghosting ResidentSleeper) Newer edit →
Line 3:		Line 3:
	In many aspects, optimization is the Chip's Challenge equivalent of [https://en.wikipedia.org/wiki/Speedrun speedrunning,] but in most cases it is more or less about improving one's overall [[Chip's Challenge scoring\|score]]. Some players, however, value other metrics such as how many bold times they have achieved rather than their overall score, and as such simply do not report scores at all on levels for which they do not have the bold on.		In many aspects, optimization is the Chip's Challenge equivalent of [https://en.wikipedia.org/wiki/Speedrun speedrunning,] but in most cases it is more or less about improving one's overall [[Chip's Challenge scoring\|score]]. Some players, however, value other metrics such as how many bold times they have achieved rather than their overall score, and as such simply do not report scores at all on levels for which they do not have the bold on.

	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 set]]s like [[Chip's Challenge 1\|CC1]] and [[Chip's Challenge Level Pack 2\|CCLP2]], are publicly available as a solution in the [[public TWS]] or as an [[AVI]], 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 tools like [[SuperCC]]. However, many bold routes, especially for older [[level set]]s like [[Chip's Challenge 1\|CC1]] and [[Chip's Challenge Level Pack 2\|CCLP2]], are publicly available as a solution in the [[public TWS]] or as an [[AVI]], 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.