If I am right this looks more like a maze solving strategy, where you can have a look at this link http://journals.analysisofalgorithms.com/2011/08/efficient-maze-solving-approach-with.html
On Thu, Dec 29, 2011 at 10:19 AM, top coder <[email protected]> wrote: > Given an n x n grid with a person and obstacles, how would you find a > path for the person to a particular destination? The person is > permitted to move left, right, up, and down > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Thanks and Regards, Raghavan KL -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
