Type of Research: Computer Game.

Summary:
Stout has created a test bed computer program (screen shot below) that allows for the testing of various Pathing techniques.

These include bidirectional breadth-first, Dijkstra’s algorithm, depth-first, Iterativedeepening depth-first search, Best-first search and A* search algorithms. Each are displayed in his test bed.

This is a superb starting point for examining various search algorithms. In addition Stout discusses generalized cylinders, convex polys and quadtrees. This paper includes numerous graphics and code samples.

---