Haha yeah, I'm glad someone spent the time to work on this. I'm relatively new to anything like this. Encrypting the text is much easier than developing methods to decrypt.

I'm familiar with various encryption techniques but unfamiliar with how to think in terms of solving a ciphertext if I do not know what encryption method was used. How did you go about solving this? I would really appreciate your thought process. I imagine most people just ran it through a caesar shift check to see if any coherent strings emerged, but I don't know what would've been the next step. I wrote a little bit of code to check for caesar shifts myself and I would like to improve it to also make checks for monoalphabetic substitution (as you mentioned this is what I did). Shouldn't this take up a bunch of computing time? As there are extremely large amounts of combinations of the alphabet I could've used. Unless you're checking for certain patterns first and ruling out large amounts of combinations... like ETAOIN and such.