maze.pas

迷宫问题输出每一步的棋盘变化 第一个用递归解决的问题

PROGRAM MIGONG;
VAR
i,j:integer;
a,b:ARRAY [1..4] OF integer;
s:ARRAY [0..7,0..10] OF char;
PROCEDURE P(x,y:integer);
VAR
i,u,v,m,n:integer;
BEGIN
  FOR i:=1 TO 4 DO
    BEGIN
      u:=x+a[i];
      v:=y+b[i];
      IF s[u,v]=' ' THEN
        BEGIN
          s[u,v]:='+';
          IF (u<>6) OR (v<>10) THEN p(u,v)
                               ELSE
                                 BEGIN
                                   FOR m:=1 TO 6 DO
                                     BEGIN
                                       writeln;
                                       FOR n:=1 TO 10 DO write(s[m,n]:2)
                                     END;
                                   writeln;
                                 END;
          s[u,v]:=' ';
        END;
    END;
END;
BEGIN
a[1]:=0;b[1]:=-1;
a[2]:=1;b[2]:=0;
a[3]:=0;b[3]:=1;
a[4]:=-1;b[4]:=0;
FOR i:=0 TO 7 DO FOR j:=0 TO 10 DO s[i,j]:=' ';
FOR i:=2 TO 10 DO s[1,i]:='X';
s[2,2]:='X';s[2,5]:='X';s[2,9]:='X';s[2,10]:='X';
s[3,4]:='X';s[3,5]:='X';s[3,7]:='X';s[3,10]:='X';
s[4,2]:='X';s[4,3]:='X';s[4,7]:='X';s[4,8]:='X';s[4,10]:='X';
s[5,5]:='X';s[5,10]:='X';
FOR i:=1 TO 8 DO s[6,i]:='X';
FOR i:=0 to 10 DO
BEGIN
s[0,i]:='X';
s[7,i]:='X';
END;
FOR i:=0 TO 7 DO s[i,0]:='X';
FOR i:=1 TO 6 DO
  BEGIN
    writeln;
    FOR j:=1 TO 10 DO write(s[i,j]:2);
  END;
writeln;
s[1,1]:='+';
p(1,1);
readln;
writeln;
END.