I tried to use a SAT solver to take strings like "I am Lord Voldemort" and generate human pronounceable permutations such as "Tom Marvolo Riddle". I thought th

I tried to use a SAT solver to take strings like "I am Lord Voldemort" and generate human pronounceable permutations such as "Tom Marvolo Riddle". I thought that if I could express permutation generation in language that the SAT solver could understand I'd end up with something faster than simply generating every permutation and checking to see if it is pronounceable. I can't be sure if I was wrong, or if my implementation sucks, but it's halting-problem grade slow (https://github.com/MatrixManAtYrService/tomriddle https://github.com/MatrixManAtYrService/tomriddle), an utter failure. Despite this, I sent a link to it in an interviewer with the message "here's some code I've written, in case you're curious". Instead of a coding challenge he just had me give him a tour of the code. I got the job (which is a good thing, because I become a much worse coder when people are watching me, I'd probably have bombed the coding challenge).