In java, Use A* search to find the the destination cell in a N by N matrix. The destination cell is (N,N).

One important condition is we can only move as many spaces as the value of the cell horizontally or vertically, So if (0,0) cell has value 4, We can only go 4 horizontal or vertical. If no path exists print "Not found". We must use A* manhattan hueristic to find our answer.(Not BFS)