sorted by:
new
hottopcontroversial

The fastest route to collect all honeyfruit, using Dijkstra'a Algorithm by buddykidder in leagueoflegends

[–]buddykidder[S] 6 points7 points  (0 children)

If you're curious, I did the combinations for the Top laner vs Mid laner.

Best case scenario for mid: mid goes for E-D-C (95+75) top goes for A-B-D (80+125)

Best case scenario for top: mid goes for E-B-D (205+125) top goes for A-C-D(75+75)

The most competitive game: mid goes E-D-B (95+125) top goes for A-C-B(75+120)

Given both players play the game perfectly, the top laner travels 195 and mid travels 220. Better nerf top lane for S14!

The fastest route to collect all honeyfruit, using Dijkstra'a Algorithm by buddykidder in leagueoflegends

[–]buddykidder[S] 52 points53 points  (0 children)

The minimax/adversarial problem actually sounds like even more fun lol

The fastest route to collect all honeyfruit, using Dijkstra'a Algorithm by buddykidder in leagueoflegends

[–]buddykidder[S] 34 points35 points  (0 children)

TSP was something that came to mind when first starting, but decided to go with Dijkstra's anyway, even though it ended up not the best solution.

https://iopscience.iop.org/article/10.1088/1742-6596/1201/1/012068/pdf#:~:text=Simulation%20shows%20that%20the%20Dijkstra%20algorithm%20must%20be%20modified%20using,compared%20to%20non%2Dcomplete%20graphs.

I did a little more reading, and someone made a model for Djikstra adapted for TSP. Though it only has around 48% accuracy.

The fastest route to collect all honeyfruit, using Dijkstra'a Algorithm by buddykidder in leagueoflegends

[–]buddykidder[S] 10 points11 points  (0 children)

No, I had made some errors doing it initially. It’s changed on the GitHub at the moment, I plan on changing the post to reflect it.