Timeline for In what instances would you want to use path-finding algorithms other than A*?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2014 at 23:00 | comment | added | DMGregory♦ | There's another interesting sense in which A* alternatives might be better for zombies. A* is great when you want one path from one start point to the nearest goal. But what if you have a whole horde of zombies all pathing toward the player? In some such situations, it may be more efficient to compute an exhaustive single-source shortest path tree for the area (pathfinding for all zombies at once), rather than re-computing branches of it repeatedly for each zombie tracing a similar route. | |
| Jul 21, 2010 at 20:56 | history | answered | AShelly | CC BY-SA 2.5 |