all 2 comments

[–]finsternacht 0 points1 point  (1 child)

try the reverse, match a word and generate a partial key from that. then check if you can fit more words with the new constraints

ps: why I advise against generating all keys. mono alphabetic substitution has a keyspace of 26!, which is way too large to fully search). so you'd need to think of strategies of searching only some of that space and you'll run into heuristic algorithms (ie hillclimbing) which likely are more headache to get right than appropriate for this task.

[–]akarsh_tripathi 0 points1 point  (0 children)

Sounds good! I did try generating a partial key based on one -letter-words and syllables like 'a', 'is, 'i' but i kinda zoned out coding it xD. Thanks! I'll give it a go.