New answers tagged

2

A* is very smart but also very dumb. It is a graph search algorithm; that means that A* assumes that any two connected points in the graph are reachable without checking back into the game itself to verify your NPC could reach any of those points. It will just search through connected points in the graph to find the most efficient path between them. It ...


Top 50 recent answers are included