Graph Topology and Battle Royale Mechanics

(blog.lukesalamone.com)

20 points by salamo2 days ago

1 comments

  • jaen2 hours ago
    With the small graph in the post, finding the solution by searching <i>backwards</i> from &quot;finished&quot; graphs (ie. single-city) using dynamic programming should be simpler than beam search and guaranteed optimal.