-
Notifications
You must be signed in to change notification settings - Fork 10
Strategy Comparison
WARNING This page could be seen as a kind of Spoiler, if you want to explore solution-tactics yourself first
After a few rounds in the game, and some Regex-experience from before, I want to make an overview of solving-methods.
If there is only a few words/characters to fit to, you can just do a Or-Wordlist separated by pipes:
ndf7|jg2|1_ for example means that the word has either to be ndf7, jg2 or 1_
If the number of characters in the Pass- and Do-Not-Pass-wordlist have no overlap, the char-lengths of words can be expressed as the number of .
So ..|... means we target the words which are 2- or 3-chars long.
But in this case it is more efficient to write ...? {notice that the ? could be at any position} (4- instead of 6-char-solution needed)
If the first or last chars of the Pass- and Do-Not-Pass-wordlist have no overlap, we can combine the any-word-solution .* with an Or-List of chars:
[az_].* for example then brings only the words which start with a, z or underscore.
If there are characters that only exist in the Do-Not-Pass-List and do not exist in the Pass-List, we can just build a placeholder for one character exluding those and multiplying it with + or *.
For example:
[^uA9]* would exclude any words that have a u-, A- or 9-character in them, because the regex describes words of any number of Chars(defined in []) that are not ^ u, A or 9.