So there are two goals here... the first one is for me to learn the best way to determine the shortest grid distance between two points, taking obstacles into account. The second is to translate that knowledge onto a hexagonal grid, instead of squares. So we should probably start with the basics... I'm thinking a recursive approach would work, but that would get considerably slower, the larger the map... and I'm hoping for some fairly big maps in the end... where should I start?