Pathfinding with A* (A Star)
Labor Day weekend gave me an opportunity to implement pathfinding. Here’s notes on some of what I read. BFS (breadth first search) explores equally in all directions. Dijkstra favors lower cost paths. A* is modified Dijkstra optimized for a single dst (uses heuristic to search towards dst). A* is the standard pathfinding for games (I also used it in college game projects ~12-14 years ago), so it
mepem37 :: Sep.05.2016 :: HeroQuest, Unreal Engine :: No Comments »