A-Star

From VT.Prog

A-star is a search algorithm that finds the lowest cost path from a given state to a goal state. The goal state need not be a single state, but a state matching some goal criteria.

A-star without a heuristic is Uniform Cost Search (UCS). It is often simple to implement A* with a heuristic of zero (aka no heuristic) and add one later if needed.

Sample Code

Sample Java Code

Read and understand this one: AStar.java

Then use this one as a template: Astar-blank.java