How do I calculate Manhattan/Euclidean distance?

Asked Jul 18, 2018539 views1 answers

This isn't even really a question for Roblox itself, since it has it's own pathfinding, but how do I calculate heuristics for Manhattan/Euclidiean distance for A*. I'm pretty sure euclidian is like square root of (a-c) + (b-d), and Manhattan is like (a-c) + (b-d).

Is this correct?

AnonymousJul 18, 2018Edited Jul 18, 2018

1 answer

✓ Accepted answer

You could calculate it like this:

local abs = math.abs;
local function ManhattanDistance(a, b)
	return abs(a.X - b.X) + abs(a.Y - b.Y) + abs(a.Z - b.Z);
end

AnonymousJul 18, 2018Permalink

2 comments

I see, so I just put in 2 parts positions, and it will return the heuristic. Is this correct?

AnonymousJul 18, 2018#

yes

AnonymousJul 18, 2018#

This discussion is preserved as it was. New answers, comments, and votes are closed.