LINE Maze Solver

Hai,

I am doing robot project . The bot is expected to start from the starting zone and negotiate the entire arena to find out the total number of discontinuities present.For the return stage, the bot must next choose and trace a path from the checkpoint zone
( destination point) to starting point with the least number of discontinuities, which may not necessarily be the shortest path distance wise to starting point.

I need a algorithm to do the above project.could you please help me to do the project?. Could you please tell me the idea to do do the project?.

Why the Poll?

Could you please tell me the idea to do do the project?.

Well, the idea is to find a path through the maze by finding all the ways you can't go. When you discover the exit, you know which parts that you traveled led to dead ends, and can be pruned from the turn/distance tree. What is left is THE path from entry to exit, so, turn around and run back to the entrance as fast as possible.