Simulated Simian Shakespeare Selector

The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type a given text, such as the complete works of William Shakespeare.

Since the cleanup logistics alone of even a few billion monkeys makes testing this theory unpractical, we could test it with a powerful computer. This has probably been proposed already so here's the idea:

A selectable variable slider that allows you to pick what you're modeling, from "Actually going to get a Shakespeare play in a few nanoseconds." to "Might get something sometime between now and infinity."

First a little background. They actually gave a group of real monkeys a keyboard to see if anything useful got written. Not only did the monkeys produce nothing but five total pages largely consisting of the letter S, the lead male began by bashing the keyboard with a stone, and the monkeys continued by urinating and defecating on it. (Much like how they generate posts on Democrat websites commenting on Donald Trump.)

So a completely accurate computer analog of this model, while entertaining, probably wouldn't be of much use, however it would be one of the selections in your variable slider. So on the far left of your selector slider, you'd have a small amount, say a billion monkeys all just hitting random keys, but each simulated simian is assigned a place in the given Shakespeare play. So if a given play has say, 100,000 letters you'd be assigned 100,000 monkeys, each tasked with coming up with his assigned letter. So if the first line is "Who's there?" this line would be assigned 11 "monkeys". Each monkey would hit a random character until the appropriate one came up at which time it would be registered in its appropriate place. I believe with this method it would only take a few nanoseconds for the entire play to be "written".

Next position on the slider would be "Letter by letter in correct sequence, each letter has assigned monkey" so "monkey" 1 would have to "type" "W" and monkey (I'll drop the quotes, you get the idea) and monkey 2 would type "h", monkey 3 would have to type "0" or the whole process gets reset. I'm not sure what kind of results you'd get with this model, I assume a few words in a row possibly but of course, the longest string of words created with this model could be saved so you might be able to watch a sentence grow over time. So to clarify, to get "Who" you'd need monkeys 1, 2 and 3 to randomly type, in exact order, "W", "h" and "o".

The variables further up the line would get increasingly closer to the actual infinite monkeys model with corresponding longer computing time with worse results.

Point is, it would take a little thought to come up with this progression of variables and that would be the interesting bit. Might make an interesting homework project for a statistical mechanics computing class.