I don't think you understood what I meant. If there is no opponent in the way, the outcome of the long path and the short path is the same, the only difference is how much SP the player it uses. That's why the computer DOES change it automatically to the most efficient one.
When there is an opponent in the way (the screenshot you shared), they are 2 completely different moves and a player might have a reason to choose one over the other. That's why the computer CAN'T assume that the player wants one move over the other. So if YOU want to move to that square in the shortest way possible, then YOU choose that exact path.