[FIXED] How does Dijkstra's Algorithm and A-Star compare?

Issue

I was looking at what the guys in the Mario AI Competition have been doing and some of them have built some pretty neat Mario bots utilizing the A* (A-Star) Pathing Algorithm.

(Video of Mario A* Bot In Action)

My question is, how does A-Star compare with Dijkstra? Looking over them, they seem similar.

Why would someone use one over the other? Especially in the context of pathing in games?

Solution

Dijkstra is a special case for A* (when the heuristics is zero).

Answered By - leiz

Answer Checked By - David Goodson (PHPFixing Volunteer)