I found something similar algorithm . one hich DFS and BFS
algorithm :- one named Trémaux's algorithm uses DFS
and for finding the shortest path it used Shortest path algorithm .
Follow the link and find the these algorithms here ..
http://en.wikipedia.org/wiki/Maze_solving_algorithm
--
You
Procedure:
1.if out of boundary return 0;
2.If reach final point return 1.
3.if(next point has no obstacle then go for it.. recursively)
PRAVEEN RAJ
DELHI COLLEGE OF ENGINEERING
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
A standard backtracking shall work...
On Dec 29, 10:02 am, Raghavan its...@gmail.com wrote:
If I am right this looks more like a maze solving strategy, where you can
have a look at this
linkhttp://journals.analysisofalgorithms.com/2011/08/efficient-maze-solvi...
On Thu, Dec 29, 2011 at
