This program takes a simple 3x3 as an input and solves it by calculating the cost with Manhattan(taxicab) Distance.
For the search method, A-star algorithm has used, which is a graph traversal in order to find efficieny. At each iteration of its main loop, A* needs to determine which of its paths to extend. It does so based on the cost of the path and an estimate of the cost required to extend the path all the way to the goal.
To visualize how to calculate the cost.
Initial vs Goal State
