摘要:
public int maxhengline(int[,] gamemap, int ii, int jj) { //以下棋位置为原点,计数器=1 int counter = 1; for (int i = 1; i < 5; i++) { try { //向左若棋子相同计数器增加 if (gamemap[ii + i, jj] == gamemap[ii, jj]) { counter = counter + 1; } else { break; } } catch { break; } } for (int i = 1; i < 5; i++) { //向右棋子相同计数器增加 阅读全文
posted @ 2013-02-27 12:54
961478
阅读(137)
评论(0)
推荐(0)
摘要:
public int maxhengline(int[,] gamemap) { int temp = 1; int zuidaqizishu = 0; for (int j = 0; j < 17; j++) { for (int i = 0; i < 20; i++) { if (gamemap[i, j] != 0) { //记录当前循环是什么颜色的判定 temp = gamemap[i, j]; if (temp == 1) ... 阅读全文
posted @ 2013-02-27 12:53
961478
阅读(148)
评论(0)
推荐(0)

浙公网安备 33010602011771号