Simulasi Pencarian Shortest Distance Path

Path finding is one problem that is common and widely applied, for example, for determining the shortest path in a map which is applied in several categories such as real-time strategy game game, analysts intelligent robot movement. One path finding algorithm that is well-known A* algorithm where the algorithm has a fast computation time. The algorithm works by determining the first two points as points A and B where point A is the point of origin, while point B is the point of destination. Usually between points A and B are included barrier that will determine the amount of the bend and the shortest or longest path from A to B. So the purpose of this study is to explain how to work or technique of Algorithm A* to determine the shortest path between two points and to design and build a software that is able to perform path finding using A* algorithm. Software development method is to use your A* which is a "heuristic estimate" h (x) which gives the value for every node x to estimate the best service that can be traversed by the node. A* visiting the node for the purpose of this heuristic estimate. Algorithm A* is an example of a best-first search. In this research implemented the search algorithm A* so that the shortest path between two points can be easily obtained. Then with a simulated search boys against girls, can describe the shortest path traversed