Timeline for In what instances would you want to use path-finding algorithms other than A*?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26, 2011 at 4:34 | comment | added | Veehmot | They may be useful in other parts of the game, but this question was specifically talking about pathfinding. | |
| Jul 15, 2010 at 7:51 | history | edited | Justin L. | CC BY-SA 2.5 |
added 233 characters in body
|
| Jul 15, 2010 at 4:30 | comment | added | Justin L. | Graph Theory and game development are inherently tied. Most AI logics and decisions/choice algorithms are best modeled with graph theory; Physics engines optimize with graph theory, Procedural Generation has a lot intertwined with it, as well as many other aspects of game design that I have not even come to realize. The other algorithms might not be useful for pathfinding, but they will come up in other parts of your game. | |
| Jul 15, 2010 at 3:31 | comment | added | Steven Evers | Good points, but graph theory and game development are not one in the same and my concern is of the latter. | |
| Jul 15, 2010 at 0:35 | history | answered | Justin L. | CC BY-SA 2.5 |