What would be a good and simple algorithm to find the shortest route between two points in a 2D array[grid] ? There can be certain obstacles in the grid i.e. some of the cells may be inaccessible. I tried googling for it and found that A* is the best for this but I am just a beginner and would like to start with something much simpler.
I'm not sure how Roger's advice would really help you here.
With most programming problems/tasks, the best thing to do at first is figure out how YOU would do it. Imagine you are standing on a grid, and you have to get from where you are to some other point, and there may be obstacles in the way.
How would you walk across the grid so that you end up at your destination?
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors