unknownunknown
New member
- Joined
- Sep 16, 2018
- Messages
- 1
Hey everyone,
I want to solve a problem like this. Perhaps someone can guide me in the right direction. I think it's some kind of optimization problem, but even that I'm not certain, and there are so many different categories of optimization that I have no idea where to start looking.
I have a baseball team of players. Each player has a rating (out of 5, the higher the better they are) at each position (8 positions, pitching/DH not included). I want to find a way of having the highest total ranking on the field, and therefore the strongest fielding overall. Of course, two players can't be playing the same position at once.
So for a simplified example, I have:
Bill
SS: 4
3B: 5
Tom
SS: 1
3B: 3
So it's not as simple as giving each player their highest position, as in this case as Bill and Tom are both best at 3B. Here you would want Bill at SS (4) and Tom at 3B (3), as the total 7 is higher than the other possible combination (5+1). Of course, it gets much harder once you have a full team of players and positions to sort though, impossible to do by hand.
So what kind of math should I be looking at to solve this? Is there some way to solve this simpler than writing a computer program to calculate every possible combination and sum them up? I know that will work, but my programming is a bit rusty, and I wouldn't mind learning a new type of math if it's not ridiculously tough.
I want to solve a problem like this. Perhaps someone can guide me in the right direction. I think it's some kind of optimization problem, but even that I'm not certain, and there are so many different categories of optimization that I have no idea where to start looking.
I have a baseball team of players. Each player has a rating (out of 5, the higher the better they are) at each position (8 positions, pitching/DH not included). I want to find a way of having the highest total ranking on the field, and therefore the strongest fielding overall. Of course, two players can't be playing the same position at once.
So for a simplified example, I have:
Bill
SS: 4
3B: 5
Tom
SS: 1
3B: 3
So it's not as simple as giving each player their highest position, as in this case as Bill and Tom are both best at 3B. Here you would want Bill at SS (4) and Tom at 3B (3), as the total 7 is higher than the other possible combination (5+1). Of course, it gets much harder once you have a full team of players and positions to sort though, impossible to do by hand.
So what kind of math should I be looking at to solve this? Is there some way to solve this simpler than writing a computer program to calculate every possible combination and sum them up? I know that will work, but my programming is a bit rusty, and I wouldn't mind learning a new type of math if it's not ridiculously tough.
