Utilize uniform-cost search algorithm to determines the least cost path from the start location to goal location
James(Yuhao) He
The problem involves the path finding in a n*n square, where each cell contains a non-negative integer indicating the "cost" of being in that cell. The cost of move is: 1 + value of the cell to be moved to. Given the starting position and goal position on the grid, the goal is to determines the least cost path from the start location to goal location.
The output is the optimal path from starting location to goal location. For example, optimal path = [(1,1), (1,2), ..., (4,3)]