⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 d.c

📁 硬件试验的源代码
💻 C
📖 第 1 页 / 共 3 页
字号:
                write_path(px,py,cir);
  break;
 case 6: for(j=1;j<=8;j++)
      for(i=0;i<17;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i][j]||block[AUTO][i][j+1]||block[AUTO][i+1][j])
    break;
     if(block[AUTO][i+2][j]||block[AUTO][i+1][j-1]||block[AUTO][i+1][j+1])
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i+1][j]=3;
      if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j+1]&&block[AUTO][i+2][j]||cal_nline()==2||cal_nline()==1&&block[AUTO][i+2][j])
          cal_pri(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  for(j=0;j<=8;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i-1][j]||block[AUTO][i][j]||block[AUTO][i+1][j]||block[AUTO][i][j+1])
    break;
     if(block[AUTO][i+2][j]!=0)
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i][j+1]=3;
      if(block[AUTO][i+1][j+1]||cal_nline()==1)
         cal_pri(i,j,&priority,&px,&py,&cir,1);
      clear();
      break;
    }
   }
  for(j=1;j<=8;j++)
      for(i=1;i<18;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+1][j]!=0)
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i-1][j]=3;
      if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j+1]||cal_nline()==1)
          cal_pri(i,j,&priority,&px,&py,&cir,2);
      clear();
      break;
    }
   }
  for(j=1;j<=9;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i-1][j]||block[AUTO][i][j]||block[AUTO][i+1][j]||block[AUTO][i][j-1])
    break;
     if(block[AUTO][i+2][j]!=0)
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i][j-1]=3;
      if(block[AUTO][i+1][j-1]||cal_nline()==1)
          cal_pri(i,j,&priority,&px,&py,&cir,3);
      clear();
      break;
    }
   }
                write_path(px,py,cir);
  break;
    }


if(priority<40&&n!=0)
   ai2(n);


}


void ai2(int n)
{  int px=now_x[AUTO],py=now_y[AUTO]; /* used for ai final position */
   int priority=0; /* the priority of position */
   int cir=0; /* record up times */
   int i,j,p,q,k,t;
   switch (n)
     {  case 0: break;
 case 1: for(j=0;j<=8;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i+1][j+1]||block[AUTO][i][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+1][j]&&block[AUTO][i+3][j+1]||block[AUTO][i+2][j+1]&&block[AUTO][i+2][j])
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i+1][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  for(j=1;j<=8;j++)
      for(i=1;i<18;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i-1][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j]&&block[AUTO][i+1][j+1])
    { block[AUTO][i-1][j]=block[AUTO][i-1][j+1]=block[AUTO][i][j-1]=block[AUTO][i][j]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,1);
      clear();
      break;
    }
   }
  write_path(px,py,cir);
  break;
 case 2: for(j=1;j<=9;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i+1][j-1]||block[AUTO][i][j-1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+2][j-1]&&block[AUTO][i+2][j]||block[AUTO][i+1][j]&&block[AUTO][i+3][j-1])
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i][j-1]=block[AUTO][i+1][j-1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  for(j=1;j<=8;j++)
      for(i=1;i<18;i++)
   { if(block[AUTO][i][j+1]||block[AUTO][i-1][j-1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j]&&block[AUTO][i+1][j+1])
    { block[AUTO][i-1][j-1]=block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,1);
      clear();
      break;
    }
   }
                write_path(px,py,cir);
  break;
 case 3: for(j=1;j<=8;j++)
      for(i=0;i<17;i++)
   { if(block[AUTO][i+1][j-1]||block[AUTO][i][j+1]||block[AUTO][i][j-1]||block[AUTO][i][j])
    break;
     if(block[AUTO][i+2][j-1]&&block[AUTO][i+1][j]&&block[AUTO][i+2][j+1])
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i+1][j-1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  for(j=0;j<=8;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i+1][j]||block[AUTO][i+1][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+2][j]||block[AUTO][i+2][j+1]||cal_nline()==1)
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i+1][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,1);
      clear();
      break;
    }
   }
  for(j=1;j<=8;j++)
      for(i=1;i<18;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j+1])
    break;
     if(block[AUTO][i+1][j+1]&&block[AUTO][i+1][j-1])
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i-1][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,2);
      clear();
      break;
    }
   }
  for(j=1;j<=9;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i-1][j-1]||block[AUTO][i-1][j]||block[AUTO][i][j]||block[AUTO][i+1][j])
    break;
     if(block[AUTO][i+2][j]&&block[AUTO][i+1][j-1]||cal_nline()==2)
    { block[AUTO][i-1][j-1]=block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,3);
      clear();
      break;
    }
   }
  write_path(px,py,cir);
  break;
 case 4: for(j=1;j<=8;j++)
      for(i=0;i<17;i++)
   { if(block[AUTO][i+1][j+1]||block[AUTO][i][j-1]||block[AUTO][i][j]||block[AUTO][i][j+1])
    break;
     if(block[AUTO][i+1][j]&&block[AUTO][i+2][j+1])
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i+1][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  for(j=0;j<=8;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i+1][j]||block[AUTO][i-1][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+2][j]&&block[AUTO][i+1][j+1]||cal_nline()==2)
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i-1][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,1);
      clear();
      break;
    }
   }
  for(j=1;j<=8;j++)
      for(i=1;i<18;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j-1])
    break;
     if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j+1])
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i-1][j-1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,2);
      clear();
      break;
    }
   }
  for(j=1;j<=9;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i+1][j-1]||block[AUTO][i+1][j]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+2][j]||block[AUTO][i+2][j]||cal_nline()==1)
    { block[AUTO][i+1][j-1]=block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,3);
      clear();
      break;
    }
   }
  write_path(px,py,cir);
  break;
 case 5: for(j=0;j<=8;j++)
      for(i=0;i<17;i++)
   { if(block[AUTO][i][j]||block[AUTO][i+1][j]||block[AUTO][i][j+1]||block[AUTO][i+1][j+1])
    break;
     if(block[AUTO][i+2][j]||block[AUTO][i+2][j+1])
    { block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i][j+1]=block[AUTO][i+1][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  write_path(px,py,cir);
  break;
 case 6: for(j=1;j<=8;j++)
      for(i=0;i<17;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i][j]||block[AUTO][i][j+1]||block[AUTO][i+1][j])
    break;
     if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j+1])
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i+1][j]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,0);
      clear();
      break;
    }
   }
  for(j=0;j<=8;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i-1][j]||block[AUTO][i][j]||block[AUTO][i+1][j]||block[AUTO][i][j+1])
    break;
     if(block[AUTO][i+2][j]&&block[AUTO][i+2][j+1]||block[AUTO][i+1][j+1])
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i][j+1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,1);
      clear();
      break;
    }
   }
/*  for(j=1;j<=8;j++)
      for(i=1;i<18;i++)
   { if(block[AUTO][i][j-1]||block[AUTO][i][j+1]||block[AUTO][i][j]||block[AUTO][i-1][j])
    break;
     if(block[AUTO][i+1][j]!=0)
    { block[AUTO][i][j-1]=block[AUTO][i][j]=block[AUTO][i][j+1]=block[AUTO][i-1][j]=3;
      if(block[AUTO][i+1][j-1]&&block[AUTO][i+1][j+1]||cal_nline()==1)
          cal_pri2(i,j,&priority,&px,&py,&cir,2);
      clear();
      break;
    }
   }
*/
  for(j=1;j<=9;j++)
      for(i=1;i<17;i++)
   { if(block[AUTO][i-1][j]||block[AUTO][i][j]||block[AUTO][i+1][j]||block[AUTO][i][j-1])
    break;
     if(block[AUTO][i+2][j]&&block[AUTO][i+2][j-1]||block[AUTO][i+1][j-1])
    { block[AUTO][i-1][j]=block[AUTO][i][j]=block[AUTO][i+1][j]=block[AUTO][i][j-1]=3;
      cal_pri2(i,j,&priority,&px,&py,&cir,3);
      clear();
      break;
    }
   }
                write_path(px,py,cir);
  break;
     }

   printf("%d",priority);


}

void cal_pri(int x,int y,int *priority,int *px,int *py ,int *cir,int round)
{ int priority_now;
  int i,j;
  priority_now=x*7+abs(5-y);
  for(i=17;i>=0;i--)
     { int count=0;
       for(j=0;j<10;j++)
  if( block[AUTO][i][j]!=0) count++;
       if(count==10) priority_now+=5*(17-x);
     }
  for(i=17;i>=0;i--)         /* avoid to stopper the unfilled block */
     { int state=0;
       if(block[AUTO][i][y]==0) state=1;
       if(state==1&&block[AUTO][i][y])
   priority_now-=2;
     }
  for(i=0;i<18;i++)        /* put the block close to other block */
     for(j=0;j<10;j++)
  if( block[AUTO][i][j]==3)
     { if(block[AUTO][i][j-1]==2)
   priority_now+=3;
       if(block[AUTO][i][j+1]==2)
   priority_now+=3;
/*       if(block[AUTO][i][j-1]==2&&block[AUTO][i][j+1]==2)
   priority_now+=(17-x);
*/
       if(block[AUTO][i][j-1]==0&&block[AUTO][i][j-2]==2)
   priority_now-=(17-x);
       if(block[AUTO][i][j+1]==0&&block[AUTO][i][j+2]==2)
   priority_now-=(17-x);
     }
  if(*priority<priority_now)
     { *priority=priority_now;
       *px=x;
       *py=y;
       *cir=round;
     }
}

void cal_pri2(int x,int y,int *priority,int *px,int *py ,int *cir,int round)
{ int priority_now;
  int i,j;
  priority_now=x*15+abs(5-y);
  for(i=17;i>=0;i--)
     { int count=0;
       for(j=0;j<10;j++)
  if( block[AUTO][i][j]!=0) count++;
       if(count==10) priority_now+=5*(17-x);
     }
/*  for(i=17;i>=0;i--)          avoid to stopper the unfilled block
     { int state=0;
       if(block[AUTO][i][y]==0) state=1;
       if(state==1&&block[AUTO][i][y])
   priority_now-=2;
     }
*/
  for(i=0;i<18;i++)        /* put the block close to other block */
     for(j=0;j<10;j++)
  if( block[AUTO][i][j]==3)
     { if(block[AUTO][i][j-1]==2)
   priority_now+=5;
       if(block[AUTO][i][j+1]==2)
   priority_now+=5;
/*       if(block[AUTO][i][j-1]==2&&block[AUTO][i][j+1]==2)
   priority_now+=(17-x);
*/
       if(block[AUTO][i][j-1]==0&&block[AUTO][i][j-2]==2)
   priority_now-=(17-x);
       if(block[AUTO][i][j+1]==0&&block[AUTO][i][j+2]==2)
   priority_now-=(17-x);
     }
  if(*priority<priority_now)
     { *priority=priority_now;
       *px=x;
       *py=y;
       *cir=round;
     }
}

void clear(void)
{ int i,j;
  for(i=0;i<18;i++)
    for(j=0;j<10;j++)
       if(block[AUTO][i][j]==3)
    block[AUTO][i][j]=0;
}

void write_path (int x,int y,int n)
{ int k=0,i;
  for(i=0;i<n;i++)
     auto_path[k++]=UP;
  if(y<now_y[AUTO])
     for(i=0;i<now_y[AUTO]-y;i++)
 auto_path[k++]=LEFT;
  else
     for(i=0;i<y-now_y[AUTO];i++)
 auto_path[k++]=RIGHT;
  auto_path[k++]=DOWN;
  auto_path[k]=0;
  auto_p=auto_path;
}

int cal_nline(void)
{ int i,j,line=0;
  for(i=17;i>=0;i--)
     { int count=0;
       for(j=0;j<10;j++)
  if( block[AUTO][i][j]!=0) count++;
       if(count==10)  line++;
     }
  return line;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -