This demo shows some examples of the A* path-finding algorithm. There are two different programs that I wrote to demo this algorithm.
The first is a flash version. This version has some nice interactive elements and animation. When any key is pressed, the red circle will find its way to the blue circle as long as there is a possible way to get there. Clicking on the grid will add or remove walls from the grid spaces.
The second version is in Java and was written for an AI assignment. This version shows a more practical application of the algorithm in plotting a course between two actual cities on a map. The user can pick start and end city on a map of the United States and compare breadth-first, depth-first and A* search results.
