I'm trying to make a program for my game and would like to see if there is an easier way of optimizing the teams to get maximum results.
Context: Each team is made up of 3 characters. The level of each of the characters determines how many points can be gained. I am trying to find out what combination of 9 characters into 3 teams will make for maximum points.
The equation for total team level is as follows: 1.5x + 0.85y + 0.65z - 1
where x is the highest level character, y the middle, and z the lowest level character.
So... now to the problem. Given 9 characters and 3 per team, there are 84 possible teams. Not only this but after selecting the first team, there are 20 possible teams to pick from for the second team (and then the third team is just the last three characters remaining). Is there any way to cut through this process to spit out which 3 teams will yield the most points?
Here are the character values just in case anyone wants to play around with them:
* A - 74698
* B - 52093
* C - 35562
* D - 21726
* E - 21019
* F - 20131
* G - 18161
* H - 17019
* I - 16889
So for instance, plugging A, B, and C into the team level equation, you get 179,440