Geekout out of the day.
Since being introduced to score orienteering i've been interested in the idea of solving an optimal route for the map (Travelling Salesman problem).
I found a site which sortof already does it if you give points, and plugged in the controls i hit. Results/differences are below
The main difference near the southwest corner is a route i didn't even think of, which is interesting, and a 50/50 choice in the top-right corner. Otherwise i was surprisingly optimal (given the controls i chose to hit)
There are a couple implementations here which i think would be quite interesting
1- plugging in all points ans seeing what the minimum distance (and approx time) required to hit all points... is it possible within the time frame for your running ability?
2- Creating a more sophisticated formula where you enter all the controls and associated scores, your running speed, time allowed, and penalty rules, and in theory you could then determine the optimal score you could acheive at your running ability... THAT would be cool.