A* Demonstration

Luis Rios's Home Page» Research » Demonstrations » A*

A* Demonstration is a multi-platform (Java) open-source (GPLv3) application that shows how A* algorithm works using grid pathfinding as the domain. It allows user to "play" with this heuristic search algorithm in order to understand it better. The main features available are:

• Editable map.
• It is possible to turn on/off the heuristic usage.
• It has simple neighborhood (up to 4 successors per node) and diagonal neighborhood (up to 8 successors per node).
• Step by step execution ("debug mode").
• Three different tie breaking strategies.
• Uniform and non-uniform edge cost are available.

Downloads

• Source code:
  • Search Algorithms Demonstrations' Git repository at GitHub
• Binaries:
  • Latest version:
    • A* Demonstration Standalone JAR - Version 2014_02_02*

• * Use the command "java -jar a_star_demo.jar" to execute the demonstration.

Images

A* Demonstration: the optimal solution has been found.

A* Demonstration: during an step by step execution.

Release notes

• Version 2014_02_02:
  • Initial version.

References

• P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cyberneticsons, vol. 4, no. 2, pp. 100-107, 1968. (PDF)