Try Everything: Difference between revisions

Content added Content deleted
m (Mass update links)
m (Mass update links)
Line 12: Line 12:
See also [[Million-to-One Chance]]. Compare [[Combinatorial Explosion]], where the ''developers'' have the headache of coping with lots of items and only one way to do it. If the game tends to say "[[I Can't Use These Things Together]]" or "[[You Can't Get Ye Flask]]", a player who is Trying Everything will get ''very'' [[Most Annoying Sound|sick of hearing it]].
See also [[Million-to-One Chance]]. Compare [[Combinatorial Explosion]], where the ''developers'' have the headache of coping with lots of items and only one way to do it. If the game tends to say "[[I Can't Use These Things Together]]" or "[[You Can't Get Ye Flask]]", a player who is Trying Everything will get ''very'' [[Most Annoying Sound|sick of hearing it]].


This is an interactive version of [[How Do I Shot Web]]. May result from [[Enter Solution Here]].
This is an interactive version of [[How Do I Shot Web?]]. May result from [[Enter Solution Here]].
{{examples}}
{{examples}}


Line 57: Line 57:


== Real Life ==
== Real Life ==
* Security experts refer to something that tries to guess passwords by trying all of them as a "dictionary attack" (i.e., try every word in the dictionary), or a more thorough "brute force attack" (try ''every'' possible combination of letters/digits/symbols/etc.). A similar method, called "rainbow table", consists of getting one's hands on an encrypted password and comparing it with a huge table of possible passwords and their encrypted equivalents.<ref>This is because good encryption methods use a [http://en.wikipedia.org/wiki/Trapdoor_function "trapdoor function"]: basically, even if you know the encryption key, you can't directly reverse the process without a different key, or a brute-force effort that dwarfs the rainbow-table approach.</ref> The exception to this is the one-time-pad cipher; if you try brute forcing a one-time-pad encryption, you end up with literally thousands to millions of interpretations, and no way to know which was the correct one (that is what the key is for).
* Security experts refer to something that tries to guess passwords by trying all of them as a "dictionary attack" (i.e., try every word in the dictionary), or a more thorough "brute force attack" (try ''every'' possible combination of letters/digits/symbols/etc.). A similar method, called "rainbow table", consists of getting one's hands on an encrypted password and comparing it with a huge table of possible passwords and their encrypted equivalents.<ref>This is because good encryption methods use a [[wikipedia:Trapdoor function|"trapdoor function"]]: basically, even if you know the encryption key, you can't directly reverse the process without a different key, or a brute-force effort that dwarfs the rainbow-table approach.</ref> The exception to this is the one-time-pad cipher; if you try brute forcing a one-time-pad encryption, you end up with literally thousands to millions of interpretations, and no way to know which was the correct one (that is what the key is for).


{{reflist}}
{{reflist}}
[[Category:Videogame Culture]]
[[Category:Videogame Culture]]
[[Category:Try Everything]]
[[Category:Try Everything]]
[[Category:Trope]]