function mazeSolver(maze)

v=1;
u=0;

n=length(maze)

for x = 1:n
    if maze(x,u)==0
       u=x;
    end
end

if u ==0
    fprintf('Error:no entry on the left'\h)
end

while v~= -1
    m(u,v)=-1;
    if v<n&&maze(u,v+1)==0
        v=v+1;
    else if u<n && maze(u+1,v)==0
        else if u>1 &&maze(u-1,v)==0
            else if v>1&&maze(u,v-1)==0
                    v=v-1;
                else maze(u,v)=-2;
                    if v<n&&maze(u,v+1)==-1
                        v=v+1;
                    else if u>1&&maze(u-1,v)==-1
                            
                         v=v-1;
                        end
                    end
                end
            end
        end
    end
end
                maze(u,v)=-1;
                for u=2:n-1
                    
                    for v=1;n
                        if maze(u,v)==-2
                            maze(u,v)=0;
                        end
                    end
                end
           maze