   A* in staggered map
  hi, i have an A* algo implemented in my engine.But the problem is that I have a staggered map.And if i use the stndard heuristic functions to calculate how farthe tile is away from the goal this results in very starne results. What heuristic shoul I use.Here''S one example of how it works nowaaaaaaaaaaaaaaaaZaaaaaaaaaaaaaaaa*aaaaaaaaaaaaaaaa*aaaaaaaaaaaaaaaa*S****************and I want it like thisaaaaaaaaaaaaaaaaZaaaaaaaaaaaaaaa*aaaaaaaaaaaaaaa*aaaaaaaaaaaaaaa*aaaS************aaaa  
  How about using the heuristic:getMax(abs(x-endx), abs(y-endy))where x is your current x and y locations and endx and endyare your current goal coordinates. Make sure that the costof moving in diagonals is greater than that of normal movementsthough. Hope this helps. ;  How about using the heuristic:getMax(abs(x-endx), abs(y-endy))where x is your current x and y locations and endx and endyare your current goal coordinates. Make sure that the costof moving in diagonals is greater than that of normal movementsthough. e.g. the cost of moving diagonaly is 2 while moving horizontally or vertically will be 1. Hope this helps. ;  I''ve implemented a normal Isometric view. For pathfinding and obstacles I have overlaid the visible map with a normal square grid. I am currently implementing the pathfinding within this grid.  