Jump to content
  • Advertisement
Sign in to follow this  
lucky6969b

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

This topic is 2067 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

It it hard to tell how x and y spans across the distance between the agent's current position and the destination?
Any ideas?
Thanks
Jack

Share this post


Link to post
Share on other sites
Advertisement
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 http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html)

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!