If you've scraped evaluation data and course attributes, finding the best possible schedule should be easy. If I'm graduating early, the best possible one SHOULD be easy, so I sat down for a QUICK coding problem.

(It turns out, not quick."avoid time conflicts" is a great way to accidentally build a 2.8-billion state search tree.) You can try the tool at dukesolver.philliplin.dev