# 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.

## 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 on other sites
Perhaps a better-worded question is in order?

##### Share on other sites
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 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 on other sites
Yes, you guess it right. That's what I am talking about.
thanks
Jack

1. 1
Rutin
19
2. 2
3. 3
JoeJ
16
4. 4
5. 5

• 27
• 20
• 13
• 13
• 17
• ### Forum Statistics

• Total Topics
631700
• Total Posts
3001790
×