Tricks or best approaches for greedy(ad-hoc) problems?

Revision en1, by baka_, 2019-11-19 22:31:52

Hi! I'm looking for the best approaches to finding a solution to greedy (let's say 1800+ difficulty) problems. Are there any implementation tricks worth it to know? How can I find the correct solution faster and eventually be able to prove it?

Tags #greedy, #adhoc


  Rev. Lang. By When Δ Comment
en1 English baka_ 2019-11-19 22:31:52 297 Initial revision (published)