Sign in to follow this  
lucky6969b

How can you tell the heuristic value using Manhattan method when using Convex search space?

Recommended Posts

I mean it is hard to tell the x-y distance between the current position and the desintation.
If you use Manhattan Heuristic, there is no such thing as 2 squares apart in the x-axis and 2 squares apart in the y-axis as the shapes are all irregular.

Thanks
Jack Edited by lucky6969b

Share this post


Link to post
Share on other sites
So if I understand correctly, you're trying to use the manhattan heuristic, but you're finding it difficult, because your A* graph is not a regular 2D grid? Is that the problem you're facing?

If so, then you simply cannot use the manhattan heuristic. I suggest you use straight line distance instead, (the Euclidean Distance described in this link [url="http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html"]http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html[/url])

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this