java递归实现的迷宫游戏

public class Migong {
 
    private int gard[][]={  {1,1,1,1,0,1,1,1},
                         {0,0,0,1,1,1,1,1},
                         {1,0,1,0,1,1,1,1},
                         {0,0,1,0,0,0,1,1},
                         {1,0,0,0,0,1,1,1},
                         {1,0,1,1,0,1,1,1},
                         {1,0,1,1,1,1,1,1}};
   
    private boolean recurive(int row,int column){
      
       boolean done = false;
       if(valid(row,column)){
           gard[row][column]=3;//走过的格子
           if(row==gard.length-1&&column==gard[0].length-1){
              done = true;
           }else{
              done=recurive(row+1,column);//下移
             
              if(!done){