I need help coming up with an algorithm that that travels a predetermined path from point A to B. I'm not interested in the A* algorithm or anything with linked lists, I just need to use simple loops.
It's a pretty complex program. I'm supposed to search through a 2d array, there are obstacles which I need to check for, I need to check all the adjacent cells from the focus cell and decide which path to travel according to costs i.e vertical and horizontal paths cost 10, while diagonal costs 14.
Again, I'm not looking for a solution. Just tips where to begin or maybe even a pseudocode will be appreciated.