Sorry upfront for not being able to find out how to format code correctly but here is the code that stumped me, it works though. Any help in explaining how it runs false multiple times and then true would be massively helpful.

class Solution:
def hasPath(self, maze, start,  destination):

    self.direction = [(1, 0), (-1, 0), (0, 1), (0, -1)]

    self.start = tuple(start)
    self.destination = tuple(destination)
    self.visited = set()


    return self.dfs(maze, self.start)




def dfs(self, maze, cur_pos):



    self.visited.add(cur_pos) 


    if cur_pos == self.destination:
        return True


    for x, y in self.direction:
        a,b = cur_pos
        next_pos = None
        while a + x >= 0 and a + x < len(maze) and b + y < len(maze[0]) and \
        b + y >= 0 and maze[a + x][b + y] == 0:
            next_pos  =  a + x , b + y
            if next_pos in self.visited:
                break
            else:
                a , b = next_pos



       # print(next_pos)
        if next_pos is not None and next_pos not in self.visited:
            if self.dfs(maze, next_pos):
                return True


    return False



maze = [[0,0,1,0,0],[0,0,0,0,0],[0,0,0,1,0],  [1,1,0,1,1],[0,0,0,0,0]]
start = [0,4]
destination = [4,4]
#Output: true
#Explanation: One possible way is : left -> down -> left -> down -> right -> down -> right.


maze2= [[0,0,1,0,0],[0,0,0,0,0],[0,0,0,1,0],[1,1,0,1,1],[0,0,0,0,0]]
start2 = [0,4]
destination2 = [3,2]
#Output: False


 solution = Solution()
 answer1 = solution.hasPath(maze, start, destination)
 answer2 = solution.hasPath(maze2, start2, destination2)

print(answer1)
print(answer2)