TADM2E 1.4
From Algorithm Wiki
e ----- f
| |
d - c b
| |
a |
| |
| |
| |
| |
| |
| |
g - h
The shortest route goes through c, d, e and f, and has more turns than the one going through g and h.