Use the stream-of-commands as seen from the chat and the stream to estimate the delay between inputs now and results later. Generate a probable future state, given the current distribution of commands. Evaluate what distribution of commands maximizes positive results, and spam that distribution.

The biggest time sink other than the program logic is creating pathing/scoring rules. I'd start with "how to successfully deposit the first pokemon in your party" - Markov chains is where you want to go.