C# winform 连连看游戏源代码

sp;             if (地图[y * 10 + i] != 已消除)                 //这里用“-1”给数组赋值来记录方块以消除                 //判断数组是否有-1的值也就是说方块是否消                 //除如果没有消除也就无法连通                 {                     return false;//则返回，返回“假”值                 }             }             return true;//不满足以上条件的话则返回“真”值         }

private bool 一折连(int x1, int y1, int x2, int y2)//联通形式为一个折弯的方法         {             if (y1 < y2)             {                 if (地图[y1 * 列 + x2] == 已消除)//右上 ↗                 {                     if (X直连(x1, x2, y1))                     {                         if (Y直连(y1, y2, x2))                         {                             z1.X = x2;                             z1.Y = y1;                             return true;                         }                     }              &n

上一页  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]  ... 下一页  >>