pythonのコードです：

```python
def mazeSolver(maze):
    stack = [(0, 0)]  # assuming (0,0) as starting position
    visited = set()    
    while stack:
        current = stack.pop()        
        if current == (len(maze)-1, len(maze[0])-1):  # assuming bottom-right corner as goal
            return "path found"        
        if current not in visited:
            visited.add(current)
            row, col = current[0], current[1]
            directions = [(row-1, col), (row+1, col), (row, col-1), (row, col+1)]
            for direction in directions:
                if 0 <= direction[0] < len(maze) and 0 <= direction[1] < len(maze[0]) and maze[direction[0]][direction[1]] != "X":
                    stack.append((direction[0], direction[1]))
    
    return "no path found"
```
このコードが正しいかどうかはチェックしていません。
Here is a python code:

```python
def mazeSolver(maze):
    stack = [(0, 0)]  # assuming (0,0) as starting position
    visited = set()    
    while stack:
        current = stack.pop()        
        if current == (len(maze)-1, len(maze[0])-1):  # assuming bottom-right corner as goal
            return "path found"        
        if current not in visited:
            visited.add(current)
            row, col = current[0], current[1]
            directions = [(row-1, col), (row+1, col), (row, col-1), (row, col+1)]
            for direction in directions:
                if 0 <= direction[0] < len(maze) and 0 <= direction[1] < len(maze[0]) and maze[direction[0]][direction[1]] != "X":
                    stack.append((direction[0], direction[1]))
    
    return "no path found"
```
Please be advised that I have not checked this code for correctness.