program find;
    const maxline=12;
                    maxcol=12;
                    posiblePath=' '; {road}
            pathToExit='|'; {the man}
        type   typeMaze=array[1..maxline,1..maxcol] of char;
        Var     maze:typeMaze;

procedure  MazeDescription (Var maze:typeMaze); {this is the garden}
        Var i,j:integer;
       Begin
            for i:=1 to maxline do
               for j:=1 to maxcol do
                    maze[i,j]:='#'; {this is ...suppose a flower}
           maze[1,4]:=' '; maze[2,4]:=' '; maze[2,5]:=' '; maze[2,6]:=' ';   {this is the path}
           maze[2,7]:=' '; maze[3,4]:=' '; maze[3,7]:=' '; maze[3,8]:=' ';
           maze[4,4]:=' '; maze[4,5]:=' '; maze[4,6]:=' '; maze[4,8]:=' ';
           maze[4,9]:=' '; maze[5,6]:=' '; maze[5,9]:=' '; maze[6,6]:=' ';
           maze[6,9]:=' '; maze[7,6]:=' '; maze[8,6]:=' '; maze[8,7]:=' ';
           maze[8,8]:=' '; maze[9,5]:=' '; maze[9,6]:=' '; maze[9,8]:=' ';
           maze[10,2]:=' '; maze[10,3]:=' '; maze[10,4]:=' '; maze[10,7]:=' ';
           maze[10,8]:=' '; maze[11,2]:=' '; maze[11,4]:=' '; maze[11,7]:=' ';
           maze[11,6]:=' '; maze[11,7]:=' '; maze[12,2]:=' '; 
  End;

procedure printMaze(maze:typeMaze); {printing the garden}
            Var i,j:integer;
       Begin
             for i:=1 to maxline do
            begin
               for j:=1 to maxcol do
                    write(maze[i,j]);
                writeln;
               end;
             writeln;
end;

function ExitFound(line,col:integer):boolean;  {I dont know what this function checks}
       begin                                                  {what IN means ?}
           ExitFound:=(line IN [1,maxline]) or (col IN [1,maxcol]);  
       end;

procedure find1(maze:typeMaze; line,col:integer); {the recursive procedure to find the exit}
   begin                                                       {why it find only one exit? }
       maze[line,col]:=pathToExit;
       if  ExitFound(line,col) 
         then begin
            printMaze(maze);
            readln;
          end
       else begin
             if maze[line-1,col]=posiblePath            
                 then  find1(maze,line-1,col);
             if maze[line,col+1]=posiblePath
                  then  find1(maze,line,col+1);
             if maze[line+1,col]=posiblePath
                  then find1(maze,line+1,col);
             if maze[line,col-1]=posiblePath
                  then find1(maze,line,col-1);
           end;
end;

Begin
       MazeDescription(maze);
       find1(maze,6,6);         {we start at line6 column6}

end.

if maze[line-1,col]=posiblePath 
    then  find1(maze,line-1,col);
if maze[line,col+1]=posiblePath
    then  find1(maze,line,col+1);
if maze[line+1,col]=posiblePath
   then find1(maze,line+1,col);
if maze[line,col-1]=posiblePath
    then find1(maze,line,col-1);