I am trying to determine the number of steps that I need to take (heuristic cost in my implementation) to get from one node to another on a hexagonal grid. The current metho
