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
🎉 Celebrating 25 Years of GameDev.net! 🎉
Not many can claim 25 years on the Internet! Join us in celebrating this milestone. Learn more about our history, and thank you for being a part of our community!
How can you tell the heuristic value using Manhattan method when using Convex search space?
Author
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
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
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)
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)
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement