Codewars. Python

path-finder-2-4kyu.py

def path_finder(maze):
    res = list(map(list,maze.split()))
    res[0][0] = 0
    moves = [(0,0)]
    for move in moves:
        y,x = move
        if  y+1 < len(res) and res[y+1][x] == ".":
            res[y+1][x] = res[y][x] + 1
            moves.append((y+1,x))
            if y+1 == len(res)-1 and x == len(res)-1:
                break
        if  y-1 >= 0 and res[y-1][x] == ".":
            res[y-1][x] = res[y][x] + 1
            moves.append((y-1,x))
        if  x+1 < len(res) and res[y][x+1] == ".":
            res[y][x+1] = res[y][x] + 1
            moves.append((y,x+1))
            if y == len(res)-1 and x+1 == len(res)-1:
                break
        if  x-1 >= 0 and res[y][x-1] == ".":
            res[y][x-1] = res[y][x] + 1
            moves.append((y,x-1))                  
    return res[len(res)-1][len(res)-1] if res[len(res)-1][len(res)-1] != "." else False