PathFinder

About

In this application, a random map, consisting of land, water, mountains, and deserts, is generated; where land is the least cost effective, followed by the mountains, the deserts, and the water. A person and a destination point is generated at a random point on the map. The objective is for the person to reach the destination point in the best/least cost effective way possible using the A* Search Algorithm (A-Star Search Algorithm). A* uses a best-first search and finds a least-cost path from a given initial node to one goal node (out of one or more possible goals). As A* traverses the graph, it follows a path of the lowest expected total cost or distance, keeping a sorted priority queue of alternate path segments along the way.

PathFinder Technologies

Java