Id like to have an efficient knapsack algorithm written in python for Draftkings daily fantasy sports. Players have position traits, price traits, and EV traits. NBA players are either [PG, PF, SF, SG, C] and need to fit into the categories of [PG, PF, SF, SG, F, G, C, UTIL] where UTIL can be anyone, F can be SF or PF, and G is PG or SG. The program should come up with the highest EV lineup of exactly 8 players given a max price.
Décerné à :
hello, place your confidence in my Python language knowledge and experience. i'll have to check out what knapsack approach works best for your problem. greets, srdjan
5 freelance ont fait une offre moyenne de 157 $ pour ce travail
I have work with Python and machine learning for some time now and am confident i can deliver on your project with ease. I can also assure you a timely delivery within the given time period.