string[,] stroldlist = new string[15, 15];//初始的List
    public string[,] strlist = new string[15, 15]; //0 ：未下，1：黑子 2：白子
     int icount = 0;//五子連線算贏
     string abc = "";//獲取是白子還是黑子，1=黑子 2=白子 0=無子

#region 判斷輸贏
    public void PanDuan() {
      //賦值
      for (int i = 0; i < 225; i++) {
        strlist[i / 15, i % 15] = sandwich[i].btn.Text;
        if (stroldlist[i / 15, i % 15] != strlist[i / 15, i % 15]) {
          stroldlist[i / 15, i % 15] = strlist[i / 15, i % 15];//把新數(shù)組賦值給舊數(shù)組
          icount = i;
          abc = strlist[i / 15, i % 15];       
        }
      }


      //檢查輸贏，共有四中情況，橫、豎、左斜、右斜
      int ix = icount / 15;//X軸
      int iy = icount % 15;//y軸
     // PublicClass.ShowMessage(ix+"--------"+iy);
      int count = 0;//五個點相連為贏
      // int kstart = 0;//五子連開始的點
      //四種情況，橫、豎、左斜、右斜


      //橫（左上角坐標為0,0）    "|"
      int k_shu_min = ix - 4 < 0 ? 0 : ix - 4;
      int k_shu_max = ix + 4 < 15 ? ix + 4 : 14;
      for (int k = k_shu_min; k <= k_shu_max; k++) {
        if (strlist[k, iy] == abc) {
          count++;
          if (count >= 5) {
            if (abc == "1") {
              PublicClass.ShowMessage("黑子勝！");
            }
            if (abc == "2") {
              PublicClass.ShowMessage("白子勝！");
            }
            return;
          }
        }else {
          count = 0;
        }
      }
      count = 0;//count值清0


      //豎      "一"
      int k_heng_min = iy - 4 < 0 ? 0 : iy - 4;
      int k_heng_max = iy + 4 < 15 ? iy + 4 : 14;
      for (int k = k_heng_min; k <= k_heng_max; k++) {
        if (strlist[ix, k] == abc) {
          count++;
          if (count >= 5) {
            if (abc == "1") {
              PublicClass.ShowMessage("黑子勝！");
            }
            if (abc == "2") {
              PublicClass.ShowMessage("白子勝！");
            }
            return;
          }
        }else {
          count = 0;
        }
      }     
      count = 0;


      //左斜     "/"
      int k_left_min = ix - 4 < 0 ? 0 : ix - 4;
      int k_left_max = ix + 4 < 15 ? ix + 4 : 14;
      for (int k = k_left_min; k <= k_left_max; k++) {
        int ky = 0;
        if (ix + iy > 14) {
          ky = ix + iy - k >= 14 ? 14 : ix + iy - k;
        } else {
          ky = ix + iy - k <= 0 ? 0 : ix + iy - k;
        }
        if (strlist[k, ky] == abc) {
          count++;
          if (count >= 5) {
            if (abc == "1") {
              PublicClass.ShowMessage("黑子勝！");
            }
            if (abc == "2") {
              PublicClass.ShowMessage("白子勝！");
            }
            return;
          }
        }else {
          count = 0;
        }
      }
      count = 0;


      //右斜      "\"
      int k_right_min = iy - 4 < 0 ? 0 : iy - 4;
      int k_right_max = iy + 4 < 15 ? iy + 4 : 14;
      for (int k = k_right_min; k <= k_right_max; k++) {
        int kx = 0;
        if (ix < iy) {         
          kx = ix - iy + k <= 0 ? 0 : ix - iy + k;  
        } else {
          kx = ix - iy + k >= 14 ? 14 : ix - iy + k;      
        }
        // PublicClass.ShowMessage(kx+"---"+k);
        if (strlist[kx, k] == abc) {
          count++;
          if (count >= 5) {
            if (abc == "1") {
              PublicClass.ShowMessage("黑子勝！");
            }
            if (abc == "2") {
              PublicClass.ShowMessage("白子勝！");
            }
            return;
          }
        }else {
          count = 0;
        }
      }
      count = 0;
    }
    #endregion