我的移动算法没有正常工作

时间:2014-01-29 23:18:42

标签: c arrays random move

经过多次修补后,我想我已经找到了我的问题的根源,因为我的球员在球场上没有正确移动:

 for (t = 1; t <= ROUNDS; t++){
      if (t % 10 == 0) {
      print_game (field);
     }
     if (teamsize > 1){

        for (m = 0; m < SIZE_TEAM; m++){
        if (team [m].presence == 1){
          if (team [m].direction == East){
             if (team [m].y == 24){
              if (field [team [m].x][team [m].y - 1] != 0){
                 rem (field [team [m].x][team [m].y - 1], teamsize);
                 field [team [m].x][team [m].y - 1] = team [m].id;
                 teamsize--;
                 }
                 else {
                 field [team [m].x][team [m].y - 1] = team [m].id;
                 }
                 }

              if (field [team [m].x][team [m].y + 1] != 0) {
                 rem (field [team [m].x][team [m].y + 1], teamsize);
                 field [team [m].x][team [m].y + 1] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x][team [m].y + 1] = team [m].id;
                 }
                 field [team [m].x][team [m].y] = 0;
              }
           else if (team [i].direction == West){
             if (team [m].y == 0){
              if (field [team [m].x][team [m].y + 1] != 0){
                 rem (field [team [m].x][team [m].y + 1], teamsize);
                 field [team [m].x][team [m].y + 1] = team [m].id;
                 teamsize--;
                 }
                 else {
                 field [team [m].x][team [m].y + 1] = team [m].id;
                 }
                }
              if (field [team [m].x][team [m].y - 1] != 0) {
                 rem (field [team [m].x][team [m].y - 1], teamsize);
                 field [team [m].x][team [m].y - 1] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x][team [m].y - 1] = team [m].id;
                 }
 field [team [m].x][team [m].y] = 0;
               }
               else if (team [i].direction == North){
                if (team [m].x == 0){
                  if (field [team [m].x + 1][team [m].y] != 0){
                     rem (field [team [m].x + 1][team [m].y], teamsize);
                     field [team [m].x + 1][team [m].y] = team [m].id;
                     teamsize--;
                     }
                     else {
                     field [team [m].x + 1][team [m].y] = team [m].id;
                 }
              if (field [team [m].x - 1][team [m].y] != 0){
                 rem (field [team [m].x - 1][team [m].y], teamsize);
                 field [team [m].x - 1][team [m].y] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x - 1][team [m].y] = team [m].id;
                 }
              field [team [m].x][team [m].y] = 0;
           }
           else if (team [i].direction == South){
            if (team [m].x == 24){
              if (field [team [m].x - 1][team [m].y] != 0){
                 rem (field [team [m].x - 1][team [m].y], teamsize);
                 field [team [m].x - 1][team [m].y] = team [m].id;
                 teamsize--;
                 }
                 else {
                 field [team [m].x - 1][team [m].y] = team [m].id;
                 }
              if (field [team [m].x + 1][team [m].y] != 0){
                 rem (field [team [m].x + 1][team [m].y], teamsize);
                 field [team [m].x + 1][team [m].y] = team [m].id;
                 teamsize--;
              }
                 else {
                    field [team [m].x + 1][team [m].y] = team [m].id;
                 }
                  field [team [m].x][team [m].y] = 0;
               }
            }
         }
       }
     }
    }
   }

  print_game (field);
   return 0;
}

我怎么知道这个?好吧,我测试了部分代码,结果很好。只有当我加入这个巨大的循环时,事情变得复杂起来。 无论如何,如果你看到任何怪癖,请告诉我。

另外,这是我的rem功能:

int rem (int id, int teamsize){
   int k;
   for (k = 0; k < teamsize; k++){
      if (team [k].id == id){
         team [k].presence = 0;
      }
   }
}

我的枚举:

   enum move_direction {East = 1, West = 2, North = 3, South = 4};

1 个答案:

答案 0 :(得分:0)

通过查看在完成以下操作后如何在for循环外声明变量k: for(int k=0;k < teamsize; ++k) 我猜你是像我这样的C语言的中间用户。

由于您尚未在此处链接之前发布的问题,因此我仅在此处严格按此帖发布。

我的理解是你在返回结构数据的两个数组teamfield时遇到了问题。

两个结构是否可能不相容,甚至更糟糕的非标量数据?

当您将团队数组编码到二维字段数组中时,线性团队数组本质上是一个表达式,其结果必须通过求值获得。尽管您具有int返回类型的各个struct数据成员,但是team数组必须具有team的struct返回类型,以便这些实例成为team数组的元素。

您可能已经知道,C的数组本质上是一个指向数组中第一个元素的指针。 C语言的这种实现表明这两个数组位于两个不同的内存地址空间中。因此,为了检索字段数组中的数据,编译器必须遍历团队数组以检索必要的int数据。

仅通过思考过程,可以合理地假设应将int值返回到数组位置括号,以便可以访问正确的字段数组元素。但并非一切都符合逻辑。

由于这些非标量数​​据点非常复杂,代码很可能无法编译。