search

codereport / city-strides-hacking

Python scripts that build optimal routes for node collection
MIT License
9 stars 3 forks source link

Enhance Hot Spots #4

Open codereport opened 1 year ago

codereport commented 1 year ago

Right now all we have is a 2n * 2n grid and we go to the one with the most nodes. It should really be more granular via maybe a clustering algorithm? and each a target cluster should be weighted by distance and only be completed when the roads are done.