human
I found an interesting problem on https://www.codewars.com/kata/5765870e190b1472ec0022a2:
## Task

You are at position [0, 0] in maze NxN and you can **only** move in one of the four cardinal directions (i.e. North, East, South, West).  Return `true` if you can reach position [N-1, N-1] or `false` otherwise.

Empty positions are marked `.`. Walls are marked `W`. Start and exit positions are empty in all test cases.

## Path Finder Series:
-       [#1: can you reach the exit?](https://www.codewars.com/kata/5765870e190b1472ec0022a2)
-       [#2: shortest path](https://www.codewars.com/kata/57658bfa28ed87ecfa00058a)
-       [#3: the Alpinist](https://www.codewars.com/kata/576986639772456f6f00030c)
-       [#4: where are you?](https://www.codewars.com/kata/5a0573c446d8435b8e00009f)
-       [#5: there's someone here](https://www.codewars.com/kata/5a05969cba2a14e541000129)

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python program you requested.

def path_finder(maze):
    grid = [list(v) for v in maze.split('\n')]
    n = len(grid)
    end = (n-1, n-1)
    def search(x, y):
        if (x,y) == end:
            return True
        elif grid[x][y] == 'W':
            return False
        elif grid[x][y] == 'V':
            return False

        grid[x][y] = 'V'

        if ((x < n-1 and search(x+1, y))
            or (y > 0 and search(x, y-1))
            or (x > 0 and search(x-1, y))
            or (y < n-1 and search(x, y+1))):

            return True

        return False

    return search(0,0)