Hello Vincent,
I do not seem to be able to open your attachment.
Is there an error that you're running into?
What algorithm are you trying to implement to solve this problem?
Do you need to write a program that calculates the shortest path or the shortest amount of time needed?
Shortest path doesn't necessarily mean for me the least amount of turns.
Did you already have a look at this page (http://nxtmastery.com/) to get started with the program?
Have you already defined your algorithm in pseudo-code?
This will help you with implementing your algorithm.
Kind Regards,
Thierry C - Platinum Applications Engineer - NI Belgium
CLD
If someone helped you, let them know. Mark as solved and/or give a kudo.