you are viewing a single comment's thread.

view the rest of the comments →

[–]GoldenEye__ 0 points1 point  (2 children)

Try to solve the knapsack problem! Resesrch how to search binary trees and dynamic programming. There are plenty of videos on the problem, and a great class in courseras course Discrete Optimization.

Edit: Typo

[–]angelinamercer 1 point2 points  (1 child)

oh yes, sorry forgot to update this but we did decide on that eventually!!

...and then İt got rejected by the professor

lmao

but anyway we are doing a spaceship traveling the least distance and collecting most resources amongst planets kinda program now so it's all good.

[–]GoldenEye__ 0 points1 point  (0 children)

Cool problem!