[Algorithms] 깊이/넓이 우선 탐색 (DFS, BFS) 활용-미로탐색(DFS)

def DFS(x, y):
    global cnt
 
    if x==y==6:
        cnt+=1
 
    else:
        for i in range(4):
            x_ = x + dx[i]
            y_ = y + dy[i]
            if 0 <=x_<= 6 and 0<=y_<=6 and board[x_][y_]==0:
                board[x_][y_] = 1
                DFS(x_, y_)
                board[x_][y_]  = 0
 
 
if __name__=='__main__':
 
    board = [list(map(int, input().split())) for _ in range(7)]
    board[0][0] = 1
 
    dx = [-1, 0, 1, 0]
    dy = [0, 1, 0, -1]
 
    cnt = 0
    DFS(0, 0)
    print(cnt)