Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
Two problems - first, you've got "50,-50" as your second stop, but I believe it should be "-50, -50".
Second, that is not the optimal path, requiring a travel of 493 lateral units (including from 0,0 and the final to 0,12, since diagonal speed is faster than horizontal or vertical, the time to get from 0 to 50,50 is the same as 0,50 or 50,0, as far as I have figured, so only the maximum of the lateral distance between two points matters, not actual distance). Slightly shorter route (421 lateral units):
[list]
[*]-50,50
[*]-35,-12
[*]-80,-40
[*]-50,-50
[*]0,-66
[*]35,-35
[*]68,-50
[*]70,-4
[*]35,12
[/list]
My Javascript snippet to calculate the shortest route: https://gist.github.com/Jimbly/180f5b0b9af02b31017646d43e2cdaf8