$ ./guess_the_languageGame Dev
Game Dev · medium · #70

What does A* add over Dijkstra's algorithm?

  1. A heuristic estimate of the remaining distance
  2. Support for negative weights
  3. Guaranteed constant-time search
  4. The ability to ignore obstacles
The heuristic steers the search toward the goal, visiting fewer nodes.
Play Game Dev ▸