I have joined CS50's Artificial Intelligence with Python online course but encountered a problem in the 0th project I downloaded from their website. It's a maze project and I have to telll the computer to find the shortest path from point A to B but what is driving me nuts is that both the Algorithms (Breadth first search and Depth first search) are producing the same output that means they are both going through the same number of states while technically BFS is expected to go through relatively small amount of states than DFS. In the youtube lecture Brian does the same thing and it worked for him but when i do it i run into this issue. Any Suggestions?? Please Help!!!!!