1,157 karma · joined April 17, 2022
I'm creating Metropolis 1998, a 2D city builder/simulation video game.
https://store.steampowered.com/app/2287430/Metropolis_1998/
I was bothered by this problem so I solved it for my own city builder game, Archapolis (still very early development):
https://www.youtube.com/watch?v=7q0l87hwmkI
I can path 200,000 to 300,000+ units simultaneously to random destinations, with a bonus of utilizing all shortest paths between two points.
The paths are all cached for constant time path finding, but I figured out how to do so efficiently (both building and storing tree/graph)
I wrote a non-technical article here:
https://www.yesboxstudios.com/2022/04/27/all-nck-shortest-pa...
https://www.marketwatch.com/investing/stock/nflx?mod=over_se...