Smogon Forums

I'm interested in solving this too, but I have basically no background in algorithms (don't know if you do), so I have no idea how to approach this besides a brute force greedy solution. Obviously the data has to be processed somehow, but I think it should be pretty easy to parse the html data because all of the image urls are the same except for the pokemon number.

This is probably a bad idea but what you could do is find something that checks/counters the largest number of things and set that as member 1, then find the thing that checks the largest number of things that mon 1 doesn't check, etc

Maybe you could have a priority list that makes sure that certain hard-to-beat sweepers like Keld or Charizard are checked on every team

Also parsing the HTML is really easy, I can probably do that in like 15 minutes

Yeah that was my idea for a greedy algorithm

Parsing the HTML is actually a lot harder than I thought...

Use regex?