My intuition is that the layout of Burning Man's city "grid" optimizes for the smallest sum of all distances between any two points on the map.
Am I correct? Is the proof obvious? Or is there another way to lay out a city to minimize the distance between any two arbitrary points?
The constraints are that a city "block" is a fixed size, there is an "empty" central public space of a certain size and you must travel only over the roads between blocks when moving between two points (any path through the public space is acceptable though.) Feel free to assume the streets on the map below completely encircle the public space, that's not really germane to the practical problem. Also we can ignore what's marked on the map as Centre Camp/Rod's Road.
Edit: here's the picture linked to: