Pathfinding with the A* Algorithm
Article
Organization
Home »
Coding
» Pathfinding with the A* Algorithm
Download as a WinZip file see below.
Scope
Implements the pathfinding algorithm A* in Visual Basic 6.0. A GUI is provided as a test environment, featuring single step evaluation on user-defined grids, along with explanations.
Quote from the Wikipedia article: "In computer science, A* (pronounced "A star") is a graph search algorithm that finds a path from a given initial node to a given goal node (or one passing a given goal test). It employs a "heuristic estimate" that ranks each node by an estimate of the best route that goes through that node. It visits the nodes in order of this heuristic estimate. The A* algorithm is therefore an example of best-first search."
Author
Herbert Glarner
Published
2005-Oct-06
External Pages
Download A*
The following ZIP file contains all neccessary files to build the GUI in VB 6.0.
AStar.zip
Screenshot
Fig. 1: Minimized screenshot of the Pathfinder's GUI
(Click for larger image)
Test
Impossible to test systematically. However, a GUI is provided as a test environment, featuring single step evaluation and explanations.
Some Feedback
Thank you very much for your vb6 code A* pathfinding, it has benefited to me.
--Thanapong Phanthong, Graduate Student, PSU, Songkla, Thailand.
Hi, I'm a student at Ho Chi Minh City University of Technology, Vietnam. I'm doing a little lesson about A Star Algorithm and I have found your program and source while searching references on Internet. It's very useful. So I write this letter to say thanks to you. And I have modified the source code to make it more suitable for illustration with some features.
--Hanh, Ha Minh Tran
Source: http://www.gandraxa.com/pathfinding_with_a_star.aspx