title: Which Procedure we can use for Maze exploration BFS or DFS
body: <p>I know we can use DFS for maze exploration. But I think we can also use BFS for maze exploration. I'm little bit confused here because most of the books and articles that I've read had used DFS for this problem. 
  What I think is that the <strong>Best Case</strong> time complexity of DFS will be better as compared to BFS. But <strong>Average</strong> and <strong>Worst</strong> <strong>Case</strong> time complexity will be same for both BFS &amp; DFS and thats why we prefer DFS over BFS. 
  Am I right or I'm having some misconception </p>