How does Dijkstra's Algorithm and A-Star compare?
Posted
by KingNestor
on Stack Overflow
See other posts from Stack Overflow
or by KingNestor
Published on 2009-08-26T05:15:58Z
Indexed on
2010/05/22
23:10 UTC
Read the original article
Hit count: 496
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?
© Stack Overflow or respective owner