Aigamedev.com seems to always have something interesting to read. This week it is using Annotated A* to find a path of at least minimum clearance through a graph. They also go into how you can reduce the graph to an annotated hierarchical pathfinding graph for near-optimal results at much greater speeds. The article is well explained and comes out with a very practical result.
If your not convinced maybe their talk on zombie brain AI from last month will convince you.
Saturday, November 13, 2010
Subscribe to:
Posts (Atom)