We are looking for someone to develop a solver in c# that would find the optimal player lineup for a day for Daily Fantasy Leagues. A list of players would be sent in json with id, name, position they play, salary, and projected score. From that list the goal would be to maximize projected score but stay under a certain salary (example $35000). Players can play more than one position, but can only be played once so that needs to be handled. The programs needs to run fast so someone with match skills that can use the appropriate algorithms would be important. Just for reference there will be about 229 players in a true daily file of players.
My solution is: for each position (A for example). I build a sorted list of player that can play in the position A and stay under a certain salary. this list is ordered by projected score descending so the first player in the list will has maximize projected score.
After creating the lists, I select the goal for each possition by: starting at first player of the list. if this player is choosen at other possition, let continue with the player next to until we found the goal in this possition.
For this approach, to run it fast. We need do sorting quickly because all others step will run very fast. For sorting the list, I will use quicksort algorithms (the most speed algorithms in sorting) to do.
If you want a demo for this soft, please inbox me.
Thank for your attention!
HuyPQ.
My proposal is to develop a dll for the solver, and console application that takes a json file as a parameter and calls the solver. The project includes unit testing.
I would develop this over my weekend.